Stabilized starting algorithms for collocation Runge-Kutta methods.
collocation Runge-Kutta methodsimplicit Runge-Kutta methodsNewton-type iterationsnumerical resultsstabilizationstarting algorithmsstiff initial value problems
Nonlinear ordinary differential equations and systems (34A34) Numerical methods for initial value problems involving ordinary differential equations (65L05) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06) Stability and convergence of numerical methods for ordinary differential equations (65L20) Finite element, Rayleigh-Ritz, Galerkin and collocation methods for ordinary differential equations (65L60)
This paper is concerned with a technique used to stabilize some starting algorithms used in the Newton-type iterations appearing when collocation Runge-Kutta methods are applied to solve stiff initial value problems. The proposed algorithm requires the solution of an additional linear system per integration step. Numerical results are also presented.
- Variable-order starting algorithms for implicit Runge-Kutta methods on stiff problems
- On the starting algorithms for fully implicit Runge-Kutta methods
- Symmetric two-step Runge-Kutta collocation methods for stiff systems of ordinary differential equations
- Starting algorithms for implicit Runge-Kutta-Nyström methods
- An efficient family of strongly \(A\)-stable Runge-Kutta collocation methods for stiff systems and DAEs. I: Stability and order results
- Comparing numerical methods for stiff systems of O.D.E:s
- scientific article; zbMATH DE number 3911612 (Why is no real title available?)
- scientific article; zbMATH DE number 940566 (Why is no real title available?)
- scientific article; zbMATH DE number 775671 (Why is no real title available?)
- Iterative schemes for three-stage implicit Runge-Kutta methods
- On the Stability and Accuracy of One-Step Methods for Solving Stiff Systems of Ordinary Differential Equations
- On the starting algorithms for fully implicit Runge-Kutta methods
- Stage Value Predictors and Efficient Newton Iterations in Implicit Runge--Kutta Methods
- Variable-order starting algorithms for implicit Runge-Kutta methods on stiff problems
- Starting algorithms for a class of RK methods for index-2 DAEs
- Stage value predictors for additive and partitioned Runge-Kutta methods
- Analysis of starting approximations for implicit Runge-Kutta methods applied to ODEs based on the reverse method
- A 17th-order radau IIA method for package \texttt{RADAU}. Applications in mechanical systems
This page was built for publication: Stabilized starting algorithms for collocation Runge-Kutta methods.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1416397)