On the computational complexity of ordinary differential equations

DOI10.1016/S0019-9958(83)80062-XzbMATH Open0541.03035OpenAlexW1964570959MaRDI QIDQ3328541FDOQ3328541

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

(27)

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

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)