Polynomial level-set method for attractor estimation

Ta-Chung Wang, Sanjay Lall, Matthew West

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

In this study, we present a polynomial level-set method for attractor estimation. This method uses the sub-level representation of sets. The problem of flowing these sets under the advection map of a dynamic system is converted to a semi-definite program, which is used to compute the coefficients of the polynomials. The required storage space for describing the result is much less than the mesh-based methods. The characteristics of attractors are used in the algorithm formulations so that the associated numerical error can be reduced. We further address the related problems of constraining the degree of the polynomials. Various numerical examples are used to show the effectiveness of the advection approach.

Original languageEnglish
Pages (from-to)2783-2798
Number of pages16
JournalJournal of the Franklin Institute
Volume349
Issue number9
DOIs
Publication statusPublished - 2012 Nov 1

Fingerprint

Polynomial Methods
Level Set Method
Advection
Attractor
Polynomials
Semidefinite Program
Polynomial
Dynamic Systems
Mesh
Numerical Examples
Formulation
Dynamical systems
Coefficient

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Signal Processing
  • Computer Networks and Communications
  • Applied Mathematics

Cite this

Wang, Ta-Chung ; Lall, Sanjay ; West, Matthew. / Polynomial level-set method for attractor estimation. In: Journal of the Franklin Institute. 2012 ; Vol. 349, No. 9. pp. 2783-2798.
@article{185b223df3224b40be75eb74cf565967,
title = "Polynomial level-set method for attractor estimation",
abstract = "In this study, we present a polynomial level-set method for attractor estimation. This method uses the sub-level representation of sets. The problem of flowing these sets under the advection map of a dynamic system is converted to a semi-definite program, which is used to compute the coefficients of the polynomials. The required storage space for describing the result is much less than the mesh-based methods. The characteristics of attractors are used in the algorithm formulations so that the associated numerical error can be reduced. We further address the related problems of constraining the degree of the polynomials. Various numerical examples are used to show the effectiveness of the advection approach.",
author = "Ta-Chung Wang and Sanjay Lall and Matthew West",
year = "2012",
month = "11",
day = "1",
doi = "10.1016/j.jfranklin.2012.08.014",
language = "English",
volume = "349",
pages = "2783--2798",
journal = "Journal of the Franklin Institute",
issn = "0016-0032",
publisher = "Elsevier Limited",
number = "9",

}

Polynomial level-set method for attractor estimation. / Wang, Ta-Chung; Lall, Sanjay; West, Matthew.

In: Journal of the Franklin Institute, Vol. 349, No. 9, 01.11.2012, p. 2783-2798.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Polynomial level-set method for attractor estimation

AU - Wang, Ta-Chung

AU - Lall, Sanjay

AU - West, Matthew

PY - 2012/11/1

Y1 - 2012/11/1

N2 - In this study, we present a polynomial level-set method for attractor estimation. This method uses the sub-level representation of sets. The problem of flowing these sets under the advection map of a dynamic system is converted to a semi-definite program, which is used to compute the coefficients of the polynomials. The required storage space for describing the result is much less than the mesh-based methods. The characteristics of attractors are used in the algorithm formulations so that the associated numerical error can be reduced. We further address the related problems of constraining the degree of the polynomials. Various numerical examples are used to show the effectiveness of the advection approach.

AB - In this study, we present a polynomial level-set method for attractor estimation. This method uses the sub-level representation of sets. The problem of flowing these sets under the advection map of a dynamic system is converted to a semi-definite program, which is used to compute the coefficients of the polynomials. The required storage space for describing the result is much less than the mesh-based methods. The characteristics of attractors are used in the algorithm formulations so that the associated numerical error can be reduced. We further address the related problems of constraining the degree of the polynomials. Various numerical examples are used to show the effectiveness of the advection approach.

UR - http://www.scopus.com/inward/record.url?scp=84867672782&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84867672782&partnerID=8YFLogxK

U2 - 10.1016/j.jfranklin.2012.08.014

DO - 10.1016/j.jfranklin.2012.08.014

M3 - Article

AN - SCOPUS:84867672782

VL - 349

SP - 2783

EP - 2798

JO - Journal of the Franklin Institute

JF - Journal of the Franklin Institute

SN - 0016-0032

IS - 9

ER -