The connection between computability of a nonlinear problem and its linearization: the Hartman-Grobman theorem revisited (Q714846): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2012.07.013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2134072594 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-computable Julia sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability, noncomputability and undecidability of maximal intervals of IVPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability, noncomputability, and hyperbolic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3282146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lemma in the Theory of Structural Stability of Differential Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5334495 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5330830 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5526485 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lipschitz continuous ordinary differential equations are polynomial-space complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of ordinary differential equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2706801 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4888828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4485693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively enumerable subsets of \(\mathbb{R}^{q}\) in two computing models Blum-Shub-Smale machine and Turing machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational unsolvability of domains of attraction of nonlinear systems / rank
 
Normal rank

Latest revision as of 17:56, 5 July 2024

scientific article
Language Label Description Also known as
English
The connection between computability of a nonlinear problem and its linearization: the Hartman-Grobman theorem revisited
scientific article

    Statements

    The connection between computability of a nonlinear problem and its linearization: the Hartman-Grobman theorem revisited (English)
    0 references
    0 references
    0 references
    0 references
    11 October 2012
    0 references
    Hartman-Grobman theorem
    0 references
    differential equations
    0 references
    linearization
    0 references
    computability
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references