An improved approximate Newton method for implicit Runge-Kutta formulas
DOI10.1016/j.cam.2011.05.027zbMath1221.65169OpenAlexW2093548760MaRDI QIDQ633983
Publication date: 2 August 2011
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2011.05.027
performanceconvergencenumerical examplesimplicit Runge-Kutta methodmodified Newton methodsRadau IIA methodstiff ODE systems
Nonlinear ordinary differential equations and systems (34A34) 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
Cites Work
- Unnamed Item
- Speeding up Newton-type iterations for stiff problems
- Variable-order starting algorithms for implicit Runge-Kutta methods on stiff problems
- Stiff differential equations solved by Radau methods
- Inexact Simplified Newton Iterations for Implicit Runge-Kutta Methods
- Control Strategies for the Iterative Solution of Nonlinear Equations in ODE Solvers
- Solving Ordinary Differential Equations I
- Implementation of Implicit Formulas for the Solution of ODE<scp>s</scp>
- On the implementation of implicit Runge-Kutta methods
- An Efficient Solution Process for Implicit Runge–Kutta Methods
- Diagonally Implicit Runge–Kutta Methods for Stiff O.D.E.’s
- Stage Value Predictors and Efficient Newton Iterations in Implicit Runge--Kutta Methods
- The error committed by stopping the Newton iteration in the numerical solution of stiff initial value problems
- Efficient Integration Methods for Stiff Systems of Ordinary Differential Equations
- Implicit Runge-Kutta Processes
- Implementation of high-order implicit Runge-Kutta methods
This page was built for publication: An improved approximate Newton method for implicit Runge-Kutta formulas
