Computational Complexity of One-Step Methods for Systems of Differential Equations
From MaRDI portal
Cites work
- An Order Bound for Runge–Kutta Methods
- Fast Algorithms for Manipulating Formal Power Series
- scientific article; zbMATH DE number 3146146 (Why is no real title available?)
- scientific article; zbMATH DE number 3628385 (Why is no real title available?)
- scientific article; zbMATH DE number 3434988 (Why is no real title available?)
- scientific article; zbMATH DE number 3279592 (Why is no real title available?)
- scientific article; zbMATH DE number 3299199 (Why is no real title available?)
- scientific article; zbMATH DE number 3355566 (Why is no real title available?)
- scientific article; zbMATH DE number 3182507 (Why is no real title available?)
- Implicit Runge-Kutta Processes
- Some Explicit Runge”Kutta Methods of High Order
Cited in
(5)- On the optimal error of algorithms for solving scalar autonomous ODE
- Computational complexity of one-step methods for a scalar autonomous differential equation
- Computational complexity of integrating ordinary differential equations
- Computability and computational complexity of the evolution of nonlinear dynamical systems
- Preparing Hamiltonians for quantum simulation: A computational framework for Cartan decomposition via Lax dynamics
This page was built for publication: Computational Complexity of One-Step Methods for Systems of Differential Equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3875248)