Computational unsolvability of domains of attraction of nonlinear systems

DOI10.1090/S0002-9939-09-09851-7zbMath1190.03039OpenAlexW2012261633MaRDI QIDQ5322874

Ning Zhong

Publication date: 23 July 2009

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9939-09-09851-7

zbMATH Keywords

domain of attractioncomputable functionscontinuous dynamical systemsasymptotically stable equilibrium pointrecursive open/closed subsets of \(\mathbb {R}^n\)recursively enumerable open/closed subsets of \(\mathbb {R}^n\)

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Attractors of solutions to ordinary differential equations (34D45) Applications of computability and recursion theory (03D80) Computation over the reals, computable analysis (03D78)

Related Items (8)

Computability and Dynamical Systems ⋮ Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems ⋮ An analytic system with a computable hyperbolic sink whose basin of attraction is non-computable ⋮ Domain control of nonlinear networked systems and applications to complex disease networks ⋮ Computability in planar dynamical systems ⋮ Computability, noncomputability, and hyperbolic systems ⋮ The connection between computability of a nonlinear problem and its linearization: the Hartman-Grobman theorem revisited ⋮ Computability of Differential Equations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• IS WAVE PROPAGATION COMPUTABLE OR CAN WAVE COMPUTERS BEAT THE TURING MACHINE?
• Computable functionals
• Computability theory of generalized functions
• The computational complexity of some julia sets
• Computability, noncomputability and undecidability of maximal intervals of IVPs
• On the estimation of asymptotic stability regions: State of the art and new proposals
• The Wave Equation with Computable Initial Data Whose Unique Solution Is Nowhere Computable
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Non-computable Julia sets
• An Algorithm for Computing Fundamental Solutions
• The Failure in Computable Analysis of a Classical Existence Theorem for Differential Equations
• On Computable Numbers, with an Application to the Entscheidungsproblem

This page was built for publication: Computational unsolvability of domains of attraction of nonlinear systems