# Efficient Automation of Index Pairs in Computational Conley Index Theory

@article{Frongillo2012EfficientAO,
title={Efficient Automation of Index Pairs in Computational Conley Index Theory},
author={Rafael M. Frongillo and Rodrigo Trevi{\~n}o},
journal={SIAM J. Appl. Dyn. Syst.},
year={2012},
volume={11},
pages={82-109}
}
• Published 23 August 2010
• Computer Science, Mathematics
• SIAM J. Appl. Dyn. Syst.
We present new methods of automating the construction of index pairs, essential ingredients of discrete Conley index theory. These new algorithms are further steps in the direction of automating computer-assisted proofs of semi-conjugacies from a map on a manifold to a subshift of finite type. We apply these new algorithms to the standard map at different values of the perturbative parameter {\epsilon} and obtain rigorous lower bounds for its topological entropy for {\epsilon} in [.7, 2].
9 Citations

## Figures from this paper

Topological Entropy Bounds for Hyperbolic Plateaus of the Henon Map
Lower bounds on topological entropy are proved for 43 hyperbolic plateaus of the Henon map by combining existing rigorous computational methods and augment the entropy algorithms of Day et al. with routines to optimize the algorithmic parameters and simplify the resulting semi-conjugate subshift.
Topological Entropy Bounds for Hyperbolic
An automated method for computing rigorous lower bounds for topological entropy is described which was originally introduced in [5] and combined with the work of Arai in [1] to form rigorousLower bounds on topologicalropy for 43 hyperbolic plateaus of the H enon map.
On determining the homological Conley index of Poincar\'e maps in autonomous systems
A theorem on computation of the homological Conley index of an isolated invariant set of the Poincaré map associated to a section in a rotating local dynamical system φ is proved. Let (N,L) be an
Sofic Shifts via Conley Index Theory: Computing Lower Bounds on Recurrent Dynamics for Maps
• Computer Science, Mathematics
SIAM J. Appl. Dyn. Syst.
• 2019
The applicability of computational Conley index techniques for computing symbolic dynamics and corresponding lower bounds on topological entropy for discrete-time systems are extended and demonstrated.
A Set-Oriented Path Following Method for the Approximation of Parameter Dependent Attractors
• Mathematics
SIAM J. Appl. Dyn. Syst.
• 2020
The feasibility of the set-oriented path following method for the computation of relative global attractors of parameter-dependent dynamical systems is illustrated by exploring the dynamics in models for shear flows during the transition to turbulence.
Chaos , Solitons & Fractals Nonlinear Science , and Nonequilibrium and Complex Phenomena
• Mathematics
• 2015
We consider Vallis’ symmetric and asymmetric Lorenz models for El Niño—systems of autonomous ordinary differential equations in 3D—with the usual parameters and, in both cases, by using rigorous
The Many Facets of Chaos
• Physics, Education
Int. J. Bifurc. Chaos
• 2015
There are many ways that a person can encounter chaos, such as through a time series from a lab experiment, a basin of attraction with fractal boundaries, a map with a crossing of stable and unstab...
Domain decomposition and model reduction for the numerical solution of PDE constrained optimization problems with localized optimization variables
• Computer Science, Mathematics
Comput. Vis. Sci.
• 2010
We introduce a technique for the dimension reduction of a class of PDE constrained optimization problems governed by linear time dependent advection diffusion equations for which the optimization

## References

SHOWING 1-10 OF 52 REFERENCES
Shift Equivalence and the Conley Index
• Mathematics
• 1999
In this paper we introduce filtration pairs for isolated invariant sets of continuous maps. We prove the existence of filtration pairs and show that, up to shift equivalence, the induced map on the
Topological Entropy Bounds for Hyperbolic Plateaus of the Henon Map
Lower bounds on topological entropy are proved for 43 hyperbolic plateaus of the Henon map by combining existing rigorous computational methods and augment the entropy algorithms of Day et al. with routines to optimize the algorithmic parameters and simplify the resulting semi-conjugate subshift.
Adaptive Set-Oriented Computation of Topological Horseshoe Factors in Area and Volume Preserving Maps
An automatic chaos verification scheme, based on set-oriented numerical methods, is described, which is especially well suited to the study of area- and volume preserving diffeomorphisms, and is geometric rather than graph theoretic in nature and does not require the computation of chain recurrent sets.
On the Estimation of Topological Entropy on Surfaces
• Mathematics, Computer Science
• 2008
We provide a rigorous lower bound for the topological entropy of planar diffeomorphisms in terms of the geometry of finite pieces of stable and unstable mani- folds of hyperbolic periodic points. Our
COMPUTING SPECIFIC ISOLATING NEIGHBORHOODS
This paper describes a computational method which allows for the efficient construction of isolating neighborhoods of the invariant sets of interest in a heteroclinic orbit.
A method for proving that monotone twist maps have no invariant circles
Abstract We present an existence theorem for certain kinds of orbits of a monotone twist map and use it to obtain a criterion for proving that there are no invariant circles with a certain range of
Dynamical systems, shape theory and the Conley index
• Mathematics
Ergodic Theory and Dynamical Systems
• 1988
Abstract The Conley index of an isolated invariant set is defined only for flows; we construct an analogue called the ‘shape index’ for discrete dynamical systems. It is the shape of the one-point
Algorithms for Rigorous Entropy Bounds and Symbolic Dynamics
• Computer Science, Mathematics
SIAM J. Appl. Dyn. Syst.
• 2008
The aim of this paper is to introduce a method for computing rigorous lower bounds for topological entropy using existing computational Conley index techniques for constructing semiconjugate symbolic dynamical systems.
A Proof of the Exponentially Small Transversality of the Separatrices for the Standard Map
Abstract:In 1984 V. F. Lazutkin [Laz84, LST89] obtained an asymptotic formula for the separatrix splitting angle for the standard map. The difficulty of this problem is related to the exponential
Topological Entropy in a Parameter Range of the Standard Map
• Mathematics
• 2009
We combine the trellis method and the braid method, and by estimating the lower bounds of the topological entropy of the standard map for a certain parameter range, we follow the change of the