The connection between computability of a nonlinear problem and its linearization: the Hartman-Grobman theorem revisited
type: Item
instance of: scholarly article
title: The connection between computability of a nonlinear problem and its linearization: the Hartman-Grobman theorem revisited
zbMATH Open document ID: 1251.03049
author: Ning Zhong
author: Daniel Graça
author: H. Scott Dumas
published in: Theoretical Computer Science
publication date: 2012-10-11T00:00:00Z
Mathematics Subject Classification ID: 03D78
Mathematics Subject Classification ID: 34C20
Mathematics Subject Classification ID: 34G20
Mathematics Subject Classification ID: 37C10
Mathematics Subject Classification ID: 37C15
zbMATH DE Number: 6093055
zbMATH Keywords: Hartman-Grobman theorem
zbMATH Keywords: differential equations
zbMATH Keywords: linearization
zbMATH Keywords: computability
MaRDI profile type: Publication
full work available at URL: j.tcs.2012.07.013
OpenAlex ID: W2134072594
cites work: Non-computable Julia sets
cites work: Computability, noncomputability and undecidability of maximal intervals of IVPs
cites work: Computability, noncomputability, and hyperbolic systems
cites work: Q3282146
cites work: A Lemma in the Theory of Structural Stability of Differential Equations
cites work: Q5334495
cites work: Q5330830
cites work: Q5526485
cites work: Lipschitz continuous ordinary differential equations are polynomial-space complete
cites work: On the computational complexity of ordinary differential equations
cites work: Q2706801
cites work: Q3994907
cites work: Q4888828
cites work: Q4485693
cites work: Recursively enumerable subsets of \(\mathbb{R}^{q}\) in two computing models Blum-Shub-Smale machine and Turing machine
cites work: Computational unsolvability of domains of attraction of nonlinear systems
DOI: 10.1016/J.TCS.2012.07.013
description: scientific article; zbMATH DE number 6093055