Minimal residual multistep methods for large stiff non-autonomous linear problems

DOI10.1016/j.cam.2019.112498zbMath1458.65074arXiv1908.07984OpenAlexW2975741474WikidataQ127217225 ScholiaQ127217225MaRDI QIDQ2223815

Boris V. Faleichik

Publication date: 3 February 2021

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1908.07984

zbMATH Keywords

stability analysisordinary differential equationsstiff systemslinear multistep methods

Mathematics Subject Classification ID

Stability and convergence of numerical methods for ordinary differential equations (65L20) Numerical methods for initial value problems involving ordinary differential equations (65L05) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06) Numerical methods for stiff equations (65L04)

Uses Software

• RODAS
• GitHub
• mrms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized Picard iterations: a class of iterated Runge-Kutta methods for stiff problems
• A Supernodal Approach to Incomplete LU Factorization with Partial Pivoting
• Convergence and stability in the numerical integration of ordinary differential equations
• Some general implicit processes for the numerical solution of differential equations
• A Special Class of Multistep Runge—Kutta Methods with Extended Real Stability Interval
• Matrix-Free Methods for Stiff Systems of ODE’s
• Iterative Solution of Nonlinear Equations in Several Variables
• Integration of Stiff Equations

This page was built for publication: Minimal residual multistep methods for large stiff non-autonomous linear problems