𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Starting Algorithms for Fully Implicit Runge-Kutta Methods

✍ Scribed by S. González-Pinto; J. I. Montijano; S. Pérez-Rodríguez

Book ID
110418694
Publisher
Springer Netherlands
Year
2000
Tongue
English
Weight
378 KB
Volume
40
Category
Article
ISSN
0006-3835

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

On the generation of mono-implicit Runge
On the generation of mono-implicit Runge-Kutta-Nyström methods by mono-implicit Runge-Kutta methods
✍ H De Meyer; G Vanden Berghe; T Van Hecke; M Van Daele 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 1017 KB

Mono-implicit Runge-Kutta methods can be used to generate implicit Runge-Kutta-Nystr6m (IRKN) methods for the numerical solution of systems of second-order differential equations. The paper is concerned with the investigation of the conditions to be fulfilled by the mono-implicit Runge-Kutta (MIRK)