An analytic system with a computable hyperbolic sink whose basin of attraction is non-computable

DOI10.1007/S00224-015-9609-5zbMATH Open1336.03051arXiv1409.1163OpenAlexW2150004712MaRDI QIDQ905698FDOQ905698

Authors: Ning Zhong, Daniel Graça 

Publication date: 28 January 2016

Published in: Theory of Computing Systems (Search for Journal in Brave)

Abstract: In many applications one is interested in finding the stability regions (basins of attraction) of some stationary states (attractors). In this paper we show that one cannot compute, in general, the basins of attraction of even very regular systems, namely analytic systems with hyperbolic asymptotically stable equilibrium points. To prove the main theorems, a new method for embedding a discrete-time system into a continuous-time system is developed.

Full work available at URL: https://arxiv.org/abs/1409.1163

Recommendations

• Computability in planar dynamical systems
• Computability, noncomputability, and hyperbolic systems
• Computational unsolvability of domains of attraction of nonlinear systems
• Toward the rigorous computation of attractors and their basins based on symbolic analysis
• Computing Domains of Attraction for Planar Dynamics

zbMATH Keywords

reachability problembasins of attractionsasymptotically stable equilibrium pointscomputability with real numbers

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78) Stability of solutions to ordinary differential equations (34D20) Approximation methods and numerical treatment of dynamical systems (37M99) Turing machines and related notions (03D10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
• Differentiable dynamical systems
• Estimating the domain of attraction for uncertain polynomial systems
• Computability with polynomial differential equations
• Title not available (Why is that?)
• Computability, noncomputability and undecidability of maximal intervals of IVPs
• Title not available (Why is that?)
• Title not available (Why is that?)
• A tutorial on computable analysis
• On Computable Numbers, with an Application to the Entscheidungsproblem
• On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
• Title not available (Why is that?)
• Title not available (Why is that?)
• Classical recursion theory. The theory of functions and sets of natural numbers
• Title not available (Why is that?)
• Closed-form analytic maps in one and two dimensions can simulate universal Turing machines
• Universal computation and other capabilities of hybrid and continuous dynamical systems
• Computing over the reals: foundations for scientific computing.
• Title not available (Why is that?)
• Non-computable Julia sets
• Computational unsolvability of domains of attraction of nonlinear systems
• Estimation of domains of attraction: A global optimization approach
• Generalized shifts: unpredictability and undecidability in dynamical systems
• Iteration, inequalities, and differentiability in analog computers
• Title not available (Why is that?)

Cited In (4)

• Intermingled basins of attraction: uncomputability in a simple physical system
• Robust non-computability of dynamical systems and computability of robust dynamical systems
• Computability of Differential Equations
• Computational unsolvability of domains of attraction of nonlinear systems

This page was built for publication: An analytic system with a computable hyperbolic sink whose basin of attraction is non-computable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q905698)