Starting algorithms for low stage order RKN methods (Q1602784): Difference between revisions
From MaRDI portal
Latest revision as of 11:07, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Starting algorithms for low stage order RKN methods |
scientific article |
Statements
Starting algorithms for low stage order RKN methods (English)
0 references
24 June 2002
0 references
While solving second-order differential equations with Runge-Kutta-Nyström (RNK) methods, usually the computational effort is dominated by the cost of solving nonlinear systems. For this reason, it is necessary to have good starting values to begin the iterations. The authors consider a type of starting algorithms without additional computational cost. They study the general order conditions and observe that the maximum order is achieved when the Runge-Kutta-Nyström method satisfies some simplifying assumptions.
0 references
iterative schemes
0 references
nonlinear systems
0 references
starting algorithms
0 references
order conditions
0 references
0 references