In this paper some classes of starting algorithms for the iterations of IRK methods are studied. They are of three types, according to their additional cost. By means of B-series, the order conditions for them are obtained. The maximum order attained by these algorithms and their construction are de
Starting algorithms for some DIRK methods
✍ Scribed by Inmaculada Higueras; Teo Roldán
- Book ID
- 110385190
- Publisher
- Springer US
- Year
- 2000
- Tongue
- English
- Weight
- 133 KB
- Volume
- 23
- Category
- Article
- ISSN
- 1017-1398
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
When semi-explicit di erential-algebraic equations are solved with implicit Runge-Kutta methods, the computational e ort is dominated by the cost of solving the nonlinear systems. That is why it is important to have good starting values to begin the iterations. In this paper we study a type of start
In this paper, we propose a technique to stabilize some starting algorithms often used in the Newton-type iterations appearing when collocation Runge-Kutta methods are applied to solve stiff initial value problems. By following the ideas given in [1], we analyze the order (classical and stiff) • of
The present paper deals with the problem of starting multistep methods. We take into consideration an Adams-Bashforth-Moulton PECE pair, with the predictor of order q and the corrector of order q + 1. To start this method, q -1 starting values are necessary, in addition to Y0. A well-known result fr