Computational complexity of real powering and improved solving linear differential equations

DOI10.1007/978-3-030-19955-5_19MaRDI QIDQ2330561zbMATH OpenOpenAlexFDO

Authors Ivan Koswara, Martin Ziegler, Svetlana V. Selivanova

Publication date 22 October 2019

Full work available at URL https://doi.org/10.1007/978-3-030-19955-5_19

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• On the Computational Complexity of Approximating Solutions for Real Algebraic Formulae
• scientific article; zbMATH DE number 2065259
• scientific article; zbMATH DE number 66626
• On the computational complexity of ordinary differential equations
• Computational Complexity and Numerical Stability of Linear Problems
• Improved complexity results on solving real-number linear feasibility problems
• Computational complexity of solving polynomial differential equations over unbounded domains
• Computational bounds on polynomial differential equations

Cited in

(9)

• Computational complexity of classical solutions of partial differential equations
• Exact real computation of solution operators for linear analytic systems of partial differential equations
• Primitive recursive ordered fields and some applications
• Primitive recursive ordered fields and some applications
• Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations
• Bit-complexity of solving systems of linear evolutionary partial differential equations
• Axiomatic reals and certified efficient exact real computation
• Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision
• Improved complexity results on solving real-number linear feasibility problems

This page was built for publication: Computational complexity of real powering and improved solving linear differential equations

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