On the computational complexity of ordinary differential equations

DOI10.1016/S0019-9958(83)80062-XMaRDI QIDQ3328541zbMATH OpenOpenAlexFDO

Authors Ker-I Ko

Publication date 1983

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0019-9958(83)80062-x

zbMATH Keywords

polynomial spacepolynomial timerecursive analysisfirst-order ordinary differential equationcomputable function

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Constructive and recursive analysis (03F60) General theory for ordinary differential equations (34A99)

Recommendations

• Computability of ordinary differential equations
• Computability of Differential Equations
• Complexity of initial-value problems for ordinary differential equations of order k
• Computational complexity of classical solutions of partial differential equations
• Complexity of initial-value problems for ordinary differential equations of order k-different models of computation
• Complexity of differential and integral equations
• Computability, Complexity and Programming with Ordinary Differential Equations
• Complexity of solutions of partial differential equations

Cited in

(30)

• A characterization of functions over the integers computable in polynomial time using discrete ordinary differential equations
• Parametrised second-order complexity theory with applications to the study of interval computation
• Topological complexity of blowup problems
• Lipschitz continuous ordinary differential equations are polynomial-space complete
• Characterizing Computable Analysis with Differential Equations
• Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach
• Complexity of blowup problems (extended abstract)
• Computable analysis of the abstract Cauchy problem in a Banach space and its applications. I
• The connection between computability of a nonlinear problem and its linearization: the Hartman-Grobman theorem revisited
• Computability aspects for 1st-order partial differential equations via characteristics
• On the computational complexity of best Chebyshev approximations
• Average-case polynomial-time computability of Hamiltonian dynamics
• Numerical solution of ordinary differential equations by fluctuationlessness theorem
• Towards computability of elliptic boundary value problems in variational formulation
• On Effective Convergence of Numerical Solutions for Differential Equations
• Computational complexity of real powering and improved solving linear differential equations
• Event detection for ODES and nonrecursive hierarchies
• Complexity of quantifier elimination in the theory of ordinary differential equations
• Church's thesis meets the \(N\)-body problem
• Computability of Differential Equations
• Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations
• In Memoriam: Ker-I Ko (1950–2018)
• The complexity of computing in continuous time: space complexity is precision
• A Domain-Theoretic Account of Picard's Theorem
• Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
• Computation with real numbers and continuous-time dynamical systems
• Solving discontinuous initial value problems with unique solutions is equivalent to computing over the transfinite
• On the computational complexity of integral equations
• Computational complexity of integrating ordinary differential equations
• Time-varying output-based Takagi-Sugeno fuzzy controller of uncertain nonlinear systems

This page was built for publication: On the computational complexity of ordinary differential equations

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