Time-step selection algorithms: adaptivity, control, and signal processing

From MaRDI portal
Publication:2489734

DOI10.1016/j.apnum.2005.04.026zbMath1089.65078OpenAlexW2142885234MaRDI QIDQ2489734

Gustaf Söderlind

Publication date: 28 April 2006

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apnum.2005.04.026




Related Items

Exponential methods for solving hyperbolic problems with application to collisionless kinetic equationsEmbedded pairs for optimal explicit strong stability preserving Runge-Kutta methodsDoubly quasi-consistent parallel explicit peer methods with built-in global error estimationAn adaptive step size controller for iterative implicit methodsLocal error estimates for moderately smooth problems. I: ODEs and DAEsAdaptive Time Step Control for Multirate Infinitesimal MethodsPractical splitting methods for the adaptive integration of nonlinear evolution equations. II: Comparisons of local error estimation and step-selection strategies for nonlinear Schrödinger and wave equationsAutomatic grid control in adaptive BVP solversEmbedded paired explicit Runge-Kutta schemesAccurate and stable time stepping in ice sheet modelingLocal error estimation and step size control in adaptive linear multistep methodsInput-to-state stability, numerical dynamics and sampled-data controlAdaptivity and computational complexity in the numerical solution of ODEsLong-term adaptive symplectic numerical integration of linear stochastic oscillators driven by additive white noiseA stepsize control algorithm for SDEs with small noise based on stochastic Runge-Kutta Maruyama methodsTime adaptive Zassenhaus splittings for the Schrödinger equation in the semiclassical regimeOn quasi-consistent integration by Nordsieck methodsEfficient adaptive step size control for exponential integratorsOptimized Runge-Kutta methods with automatic step size control for compressible computational fluid dynamics


Uses Software


Cites Work