Variable-order starting algorithms for implicit Runge-Kutta methods on stiff problems (Q1861976): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: NSDTST / rank | |||
Normal rank | |||
Revision as of 06:47, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Variable-order starting algorithms for implicit Runge-Kutta methods on stiff problems |
scientific article |
Statements
Variable-order starting algorithms for implicit Runge-Kutta methods on stiff problems (English)
0 references
10 March 2003
0 references
The authors present a family of starting algorithms for Newton schemes for solving the equations in an implicit Runge-Kutta method. The algorithm is based on the Lagrangian interpolation of the last two integration steps. They show by numerical experiments that the technique improves the performance of implicit Runge-Kutta methods for stiff problems.
0 references
stiff initial value problems
0 references
implicit Runge-Kutta methods
0 references
starting algorithms
0 references
Newton schemes
0 references
numerical experiments
0 references
