The connection between computability of a nonlinear problem and its linearization: the Hartman-Grobman theorem revisited
DOI10.1016/j.tcs.2012.07.013zbMath1251.03049OpenAlexW2134072594MaRDI QIDQ714846
Ning Zhong, Daniel Silva Graça, H. Scott Dumas
Publication date: 11 October 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.07.013
Transformation and reduction of ordinary differential equations and systems, normal forms (34C20) Nonlinear differential equations in abstract spaces (34G20) Topological and differentiable equivalence, conjugacy, moduli, classification of dynamical systems (37C15) Dynamics induced by flows and semiflows (37C10) Computation over the reals, computable analysis (03D78)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lipschitz continuous ordinary differential equations are polynomial-space complete
- Recursively enumerable subsets of \(\mathbb{R}^{q}\) in two computing models Blum-Shub-Smale machine and Turing machine
- Computability, noncomputability, and hyperbolic systems
- On the computational complexity of ordinary differential equations
- Computability, noncomputability and undecidability of maximal intervals of IVPs
- Computational unsolvability of domains of attraction of nonlinear systems
- A Lemma in the Theory of Structural Stability of Differential Equations
- Non-computable Julia sets
This page was built for publication: The connection between computability of a nonlinear problem and its linearization: the Hartman-Grobman theorem revisited
