Pages that link to "Item:Q933414"
From MaRDI portal
The following pages link to Adaptivity and computational complexity in the numerical solution of ODEs (Q933414):
Displaying 12 items.
- Computational complexity of solving polynomial differential equations over unbounded domains (Q264572) (← links)
- The impact of smooth \(W\)-grids in the numerical solution of singular perturbation two-point boundary value problems (Q434632) (← links)
- Automatic grid control in adaptive BVP solvers (Q621783) (← links)
- An efficient time-step-based self-adaptive algorithm for predictor-corrector methods of Runge-Kutta type (Q645734) (← links)
- A new view of the computational complexity of IVP for ODE (Q1862219) (← links)
- A nonstandard finite difference scheme for a basic model of cellular immune response to viral infection (Q2005023) (← links)
- Extremely low order time-fractional differential equation and application in combustion process (Q2207973) (← links)
- Polynomial cost for solving IVP for high-index DAE (Q2479586) (← links)
- Computation and Applications of Mathieu Functions: A Historical Perspective (Q5162640) (← links)
- The Effective Stability of Adaptive Timestepping ODE Solvers (Q5470911) (← links)
- An Hermite-Obreshkov method for 2nd-order linear initial-value problems for ODE. With special attention paid to the Mathieu equation (Q6559445) (← links)
- Semi-implicit finite-difference methods for compressible gas dynamics with curved boundaries: a ghost-point approach (Q6613477) (← links)
