𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Starting algorithms for IRK methods

✍ Scribed by M.P. Laburta

Book ID
104338474
Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
851 KB
Volume
83
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

✦ Synopsis

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 derived too.

πŸ“œ SIMILAR VOLUMES

IRK methods for DAE: starting algorithms
IRK methods for DAE: starting algorithms
✍ Teo RoldΓ‘n; Inmaculada Higueras πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 177 KB

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

Stabilized starting algorithms for collo
Stabilized starting algorithms for collocation Runge-Kutta methods
✍ S. GonzΓ‘lez-Pinto; J.I. Montijano; S. PΓ©rez-RodrΓ­guez πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 861 KB

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