Pages that link to "Item:Q1862219"
From MaRDI portal
The following pages link to A new view of the computational complexity of IVP for ODE (Q1862219):
Displaying 10 items.
- Computational complexity of solving polynomial differential equations over unbounded domains (Q264572) (← links)
- The computational complexity of extrapolation methods (Q626884) (← links)
- Adaptivity and computational complexity in the numerical solution of ODEs (Q933414) (← links)
- A procedure with stepsize control for solving \(n\) one-dimensional IVPs (Q955284) (← links)
- Some recent advances in validated methods for IVPs for ODEs (Q1612462) (← links)
- Computability of ordinary differential equations (Q1670741) (← links)
- Polynomial cost for solving IVP for high-index DAE (Q2479586) (← links)
- Numerical solutions of index-1 differential algebraic equations can be computed in polynomial time (Q2492797) (← links)
- Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems (Q5326355) (← links)
- An Hermite-Obreshkov method for 2nd-order linear initial-value problems for ODE. With special attention paid to the Mathieu equation (Q6559445) (← links)