Computational hyperbolicity
Nowadays, computers are quite often used for proving theorems whose direct analytic verification is not possible. The paper under review deals with the problem of computer assisted proof of hyperbolicity of a given set using a concept of semihyperbolicity. Taking into account that semihyperbolicity does not require the splitting of the space to be invariant, it can be directly and relatively easily verified through a direct numerical computation. For example, the authors prove hyperbolicity of the celebrated Hénon attractor associated with the Hénon map of the real plane into itself, \[ H_{a,b}:(x,y) \mapsto(a-x^{2}+by,x) , \] for \(a=5.4\) and \(b=-1\) in less than 10 seconds on a 2 GHz personal computer.
- scientific article; zbMATH DE number 1929952
- Computing the hyperbolicity constant
- Hyperbolic problems: theory and computation
- Computing hyperbolic choreographies
- Computability, noncomputability, and hyperbolic systems
- scientific article; zbMATH DE number 2034395
- Computational approach to hyperelliptic Riemann surfaces
- Computation of hyperbolic structures in knot theory
- Computers and differential geometry
- Computational aspects of singularities
- s-limit shadowing is \(\mathcal C^0\)-dense
- Expansivity implies existence of Hölder continuous Lyapunov function
- Verification of hyperbolicity for attractors of some mechanical systems with chaotic dynamics
- scientific article; zbMATH DE number 4033523 (Why is no real title available?)
- Rigorous computation of expansion in one-dimensional dynamics
- Topological horseshoe and uniform hyperbolicity of the symplectic coupled Hénon map
- Semi-hyperbolicity and hyperbolicity
- Hyperbolicity conditions for the Lorenz model
This page was built for publication: Computational hyperbolicity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q632360)
