On the sighting of unicorns: A variational approach to computing invariant sets in dynamical systems.

  title={On the sighting of unicorns: A variational approach to computing invariant sets in dynamical systems.},
  author={Oliver Junge and Ioannis G. Kevrekidis},
  volume={27 6},
We propose to compute approximations to invariant sets in dynamical systems by minimizing an appropriate distance between a suitably selected finite set of points and its image under the dynamics. We demonstrate, through computational experiments, that this approach can successfully converge to approximations of (maximal) invariant sets of arbitrary topology, dimension, and stability, such as, e.g., saddle type invariant sets with complicated dynamics. We further propose to extend this approach… 
6 Citations

Convex Computation of Extremal Invariant Measures of Nonlinear Dynamical Systems and Markov Processes

A simple method to certify the nonexistence of an invariant measure, which is an important question in the theory of Markov processes, is presented and how the presented framework can be adapted to compute eigenmeasures of the Perron–Frobenius operator is described.

Global Invariant Manifolds of Dynamical Systems with the Compatible Cell Mapping Method

An iterative compatible cell mapping (CCM) method with the digraph theory is presented in this paper to compute the global invariant manifolds of dynamical systems with high precision and high

Sustainability over sets and the business cycle

Many rigorous works have examined the behavior of Kaldor business cycle models. In this paper, utilizing the sustainability over sets (SOS) concept, a general theorem is proven establishing necessary

Sustainability Over Sets

In this work, the novel concept of “Sustainability Over Set” (SOS) is introduced. This novel concept provides broad flexibility in incorporating human input into system sustainability assessment. In

On sample-based computations of invariant sets

This paper leads to a novel sample-based computational procedure to compute the invariant set of a (discrete-time) dynamical system, and the mathematical description of these new insights can be formulated in strikingly basic set-theoretic terms.



The computation of convex invariant sets via Newton's method

A novel approach to the computation of convex invariant sets of dynamical systems by employing a Banach space formalism to formulate the property of a convex, compact set to be invariant as a zero-finding problem in this Banachspace.

A Rigorous Numerical Method for the Global Analysis of Infinite-Dimensional Discrete Dynamical Systems

A numerical method is presented to prove certain statements about the global dynamics of infinite-dimensional maps and the existence of period points, connecting orbits, and chaotic dynamics in the Kot--Schaffer growth-dispersal model for plants.

The Path towards a Longer Life: on Invariant Sets and the Escape Time Landscape

  • E. Bollt
  • Physics
    Int. J. Bifurc. Chaos
  • 2005
The landscape of an invariant set is investigated, which leads to a simple gradient search algorithm to construct points close to the invariantSet, which is not as dimension dependant as the previous techniques.

Dynamical Systems And Numerical Analysis

This book unites the study of dynamical systems and numerical solution of differential equations. The first three chapters contain the elements of the theory of dynamical systems and the numerical

The Computation of Unstable Manifolds Using Subdivision and Continuation

Combining the subdivision algorithm for the computation of relative global attractors as described in [1] with a box-oriented continuation technique, we develop a new method for the computation of

Stagger-and-step method: detecting and computing chaotic saddles in higher dimensions.

This work presents the first general method to locate and visualize chaotic saddles in higher dimensions and it is shown that this phenomenon is a common phenomenon in higher dimensional dynamical systems.