The connection between computability of a nonlinear problem and its linearization: the Hartman-Grobman theorem revisited

DOI10.1016/J.TCS.2012.07.013MaRDI QIDQ714846zbMATH OpenOpenAlexFDO

Authors Ning Zhong, Daniel 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

zbMATH Keywords

differential equationslinearizationcomputabilityHartman-Grobman theorem

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78) Transformation and reduction of ordinary differential equations and systems, normal forms (34C20) Nonlinear differential equations in abstract spaces (34G20) Dynamics induced by flows and semiflows (37C10) Topological and differentiable equivalence, conjugacy, moduli, classification of dynamical systems (37C15)

Recommendations

• A global Hartman-Grobman theorem
• Global topological linearization in critical case
• Computability, noncomputability, and hyperbolic systems
• scientific article; zbMATH DE number 501021
• The Hartman-Grobman theorem for semilinear hyperbolic evolution equations

Cites work

• scientific article; zbMATH DE number 1581767 (Why is no real title available?)
• scientific article; zbMATH DE number 3163943 (Why is no real title available?)
• scientific article; zbMATH DE number 42077 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• scientific article; zbMATH DE number 918596 (Why is no real title available?)
• scientific article; zbMATH DE number 3204015 (Why is no real title available?)
• scientific article; zbMATH DE number 3207495 (Why is no real title available?)
• scientific article; zbMATH DE number 3239038 (Why is no real title available?)
• A Lemma in the Theory of Structural Stability of Differential Equations
• Computability, noncomputability and undecidability of maximal intervals of IVPs
• Computability, noncomputability, and hyperbolic systems
• Computational unsolvability of domains of attraction of nonlinear systems
• Lipschitz continuous ordinary differential equations are polynomial-space complete
• Non-computable Julia sets
• On the computational complexity of ordinary differential equations
• Recursively enumerable subsets of \(\mathbb{R}^{q}\) in two computing models Blum-Shub-Smale machine and Turing machine

Cited in

(4)

• Computability of limit sets for two-dimensional flows
• Computability aspects for 1st-order partial differential equations via characteristics
• Computing the exact number of periodic orbits for planar flows
• Computability of Differential Equations

This page was built for publication: The connection between computability of a nonlinear problem and its linearization: the Hartman-Grobman theorem revisited

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