𝔖 Bobbio Scriptorium
✦   LIBER   ✦

IRK methods for DAE: starting algorithms

✍ Scribed by Teo Roldán; Inmaculada Higueras

Book ID
104338999
Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
177 KB
Volume
111
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

✦ Synopsis

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 starting algorithms, without additional computational cost, in the case of index-1 DAE. The order of the starting values is deÿned, and by using DA-series and rooted trees we obtain their general order conditions. If the RK satisÿes some simpliÿed assumptions, then the maximum order can be obtained.

📜 SIMILAR VOLUMES

Starting algorithms for IRK methods
Starting algorithms for IRK methods
✍ M.P. Laburta 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 851 KB

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 a class of RK me
Starting algorithms for a class of RK methods for index-2 DAEs
✍ I. Higueras; T. Roldán 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 1021 KB

When semiexplicit differential-algebraic equations are solved with implicit Runge-Kutta methods (l:tK), the computational effort is dominated by the cost of solving the nonlinear systems, and therefore it is important to have good starting values to begin the iterations. For semiexplicit index-2 DAE

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