Starting algorithms for the iterations of the RKN-Gauss methods (Q1807668)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Starting algorithms for the iterations of the RKN-Gauss methods |
scientific article |
Statements
Starting algorithms for the iterations of the RKN-Gauss methods (English)
0 references
24 April 2000
0 references
Gauss methods are symplectic implicit Runge-Kutta methods of maximal order. This article considers the numerical solution of the nonlinear Runge-Kutta system, when the method is applied to problems of the form \(y''=f(y)\). Using the information of the previous step, and eventually one or two additional function evaluations, formulas for starting approximations for the fixed point iteration are derived. Some numerical experiments compare the efficiency of different starting procedures.
0 references
implicit Runge-Kutta methods
0 references
Gauss methods
0 references
starting algorithms
0 references
Runge-Kutta-Nyström method
0 references
symplectic implicit Runge-Kutta methods
0 references
numerical experiments
0 references