Rigorous numerical models for the dynamics of complex Henon mappings on their chain recurrent sets

Abstract

We describe a rigorous and efficient computer algorithm for building a model of the dynamics of a polynomial diffeomorphism of C2 on its chain recurrent set, and for sorting points into approximate chain transitive components. Further, we give explicit estimates which quantify how well this algorithm approximates the chain recurrent set and distinguishes the chain transitive components. We also discuss our implementation for the family of Henon mappings, fa,c(x,y) = (x2 + c - ay, x), into a computer program called Hypatia, and give several examples of running Hypatia on Henon mappings.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…