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

DOI10.1016/J.TCS.2012.07.013zbMATH Open1251.03049OpenAlexW2134072594MaRDI QIDQ714846FDOQ714846

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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?)
• Lipschitz continuous ordinary differential equations are polynomial-space complete
• Title not available (Why is that?)
• A Lemma in the Theory of Structural Stability of Differential Equations
• Computability, noncomputability, and hyperbolic systems
• Non-computable Julia sets
• On the computational complexity of ordinary differential equations
• Computational unsolvability of domains of attraction of nonlinear systems
• 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)