Runge-Kutta Starters for Multistep Methods
From MaRDI portal
Publication:3903977
DOI10.1145/355900.355901zbMath0455.65051OpenAlexW2103481004WikidataQ128297261 ScholiaQ128297261MaRDI QIDQ3903977
Publication date: 1980
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2027/uiuo.ark:/13960/t7gq8g962
error estimatesRunge-Kutta methodsmultistep methodscomputational comparisonsimplicit methodsstarting procedureschoice of step length
Related Items
New runge kutta starters for multistep methods ⋮ Bound-preserving modified exponential Runge-Kutta discontinuous Galerkin methods for scalar hyperbolic equations with stiff source terms ⋮ Starting BDF and Adams codes at optimal order ⋮ A Runge-Kutta starter for a multistep method for differential-algebraic systems with discontinuous effects ⋮ A history of Runge-Kutta methods ⋮ Advances in the theory of variable stepsize variable formula methods for ordinary differential equations ⋮ Runge-Kutta restarters for multistep methods in presence of frequent discontinuities ⋮ The tree and forest spaces with applications to initial-value problem methods ⋮ Starting variable-order Adams and BDF codes ⋮ Runge-Kutta methods: Some historical notes ⋮ Software based on explicit RK formulas ⋮ A computational procedure for interaction of high-speed vehicles on flexible structures without assuming known vehicle nominal motion ⋮ Stiff ODE solvers: A review of current and coming attractions ⋮ Some new two-step integration methods ⋮ Consistency and convergence of general linear multistep variable stepsize variable formula methods ⋮ A probabilistic model for the numerical solution of initial value problems ⋮ Efficient time integrators in the numerical method of lines ⋮ Starting step size for an ODE solver ⋮ Variable stepsize variable formula methods based on predictor-corrector schemes
