On the computational complexity of ordinary differential equations

DOI10.1016/S0019-9958(83)80062-XzbMath0541.03035OpenAlexW1964570959MaRDI QIDQ3328541

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 timerecursive analysispolynomial spacefirst-order ordinary differential equationcomputable function

Mathematics Subject Classification ID

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

Related Items (21)

Computational complexity of integrating ordinary differential equations ⋮ Towards computability of elliptic boundary value problems in variational formulation ⋮ On Effective Convergence of Numerical Solutions for Differential Equations ⋮ A characterization of functions over the integers computable in polynomial time using discrete ordinary differential equations ⋮ Event detection for ODES and nonrecursive hierarchies ⋮ In Memoriam: Ker-I Ko (1950–2018) ⋮ Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy ⋮ Average-case polynomial-time computability of hamiltonian dynamics ⋮ Complexity of Blowup Problems ⋮ Computable Analysis of the Abstract Cauchy Problem in a Banach Space and Its Applications (I) ⋮ On the computational complexity of integral equations ⋮ Numerical solution of ordinary differential equations by fluctuationlessness theorem ⋮ Church's thesis meets the \(N\)-body problem ⋮ The connection between computability of a nonlinear problem and its linearization: the Hartman-Grobman theorem revisited ⋮ Parametrised second-order complexity theory with applications to the study of interval computation ⋮ Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations ⋮ On the computational complexity of best Chebyshev approximations ⋮ A Domain-Theoretic Account of Picard's Theorem ⋮ Computability aspects for 1st-order partial differential equations via characteristics ⋮ Computability of 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