Average-case polynomial-time computability of Hamiltonian dynamics

DOI10.4230/LIPICS.MFCS.2018.30MaRDI QIDQ5005130zbMATH OpenOpenAlexFDO

Authors Akitoshi Kawamura, Holger Thies, Martin Ziegler

Publication date 4 August 2021

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2018/9612/pdf/LIPIcs-MFCS-2018-30.pdf/

zbMATH Keywords

average-case complexitycomputable analysiscomputation in physicsdynamical systemsreal computation

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Publication:4941673
• The complexity of N-body simulation
• Long-time averaging for integrable Hamiltonian dynamics
• Computability with polynomial differential equations
• Average-case bit-complexity theory of real functions

Cites work

• A characterization of real analytic functions
• A global existence theorem for the four body problem of Newtonian mechanics
• Average Case Complete Problems
• Average-case bit-complexity theory of real functions
• Complexity theory for operators in analysis
• Computability, noncomputability and undecidability of maximal intervals of IVPs
• Computational complexity of real functions
• Computing power series in polynomial time
• scientific article; zbMATH DE number 3144514 (Why is no real title available?)
• scientific article; zbMATH DE number 4051615 (Why is no real title available?)
• scientific article; zbMATH DE number 52121 (Why is no real title available?)
• scientific article; zbMATH DE number 1099342 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• scientific article; zbMATH DE number 1552437 (Why is no real title available?)
• scientific article; zbMATH DE number 3428577 (Why is no real title available?)
• Improbability of Collisions in Newtonian Gravitational Systems. II
• Lipschitz continuous ordinary differential equations are polynomial-space complete
• On the complexity of solving initial value problems
• On the computational complexity of ordinary differential equations
• On the definitions of computable real continuous functions

Cited in

(10)

• Computational complexity of classical solutions of partial differential equations
• Bit-complexity of solving systems of linear evolutionary partial differential equations
• Computability of topological entropy: from general systems to transformations on Cantor sets and the interval
• Parametrised second-order complexity theory with applications to the study of interval computation
• Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations
• scientific article; zbMATH DE number 205220 (Why is no real title available?)
• Computability of Differential Equations
• A universal ordinary differential equation
• Solovay reducibility and continuity
• Exact real computation of solution operators for linear analytic systems of partial differential equations

This page was built for publication: Average-case polynomial-time computability of Hamiltonian dynamics

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