On the complexity of Anosov saddle transitions

DOI10.1016/j.jco.2017.03.002zbMath1372.65332OpenAlexW2597732660MaRDI QIDQ2402418

Michael Maller

Publication date: 7 September 2017

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jco.2017.03.002

zbMATH Keywords

computational complexitypseudo-orbitshadowingAnosov diffeomorphismhyperbolic toral automorphismssaddle transition problem

Mathematics Subject Classification ID

Uniformly hyperbolic systems (expanding, Anosov, Axiom A, etc.) (37D20) Complexity and performance of numerical algorithms (65Y20) Numerical nonlinear stabilities in dynamical systems (65P40)

Related Items

On the complexity of fitted toral dynamics

Cites Work

• Unnamed Item
• On the size of the domain of linearization in Hartman's theorem
• Fitted diffeomorphisms of non-simply connected manifolds
• Homology theory and dynamical systems
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Differentiable dynamical systems
• Structurally stable diffeomorphisms are dense