Computational complexity of solving polynomial differential equations over unbounded domains (Q264572): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1409.0451 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4769046 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3910522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4528895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breaking the limits: The Taylor series method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934694 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of solving initial value problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5384984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3639060 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new view of the computational complexity of IVP for ODE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Ordinary Differential Equations Using Taylor Series / 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: Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability with polynomial differential equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptivity and computational complexity in the numerical solution of ODEs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Software Package for the Numerical Integration of ODEs by Means of High-Order Taylor Methods / 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: Q4002474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN EFFECTIVE CAUCHY-PEANO EXISTENCE THEOREM FOR UNIQUE SOLUTIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Church's thesis meets the \(N\)-body problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit a-priori error bounds and adaptive error control for approximation of nonlinear initial value differential systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of one-step methods for a scalar autonomous differential equation / rank
 
Normal rank

Latest revision as of 17:31, 11 July 2024

scientific article
Language Label Description Also known as
English
Computational complexity of solving polynomial differential equations over unbounded domains
scientific article

    Statements

    Computational complexity of solving polynomial differential equations over unbounded domains (English)
    0 references
    0 references
    0 references
    31 March 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    ordinary differential equations
    0 references
    computation with real numbers
    0 references
    computational complexity
    0 references
    adaptive Taylor algorithms
    0 references
    0 references
    0 references
    0 references
    0 references