✦ LIBER ✦

Partitioned Krylov subspace iteration in implicit Runge–Kutta methods

✍ Scribed by K. Dekker

Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 130 KB
Volume: 431
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2009.03.015

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Automatic partitioning in linearly-impli

Automatic partitioning in linearly-implicit Runge-Kutta methods

✍ Mario Büttner; Bernhard A. Schmitt; Rüdiger Weiner 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 977 KB

Monotonicity and boundedness in implicit

Monotonicity and boundedness in implicit Runge-Kutta methods

✍ M. N. Spijker 📂 Article 📅 1986 🏛 Springer-Verlag 🌐 English ⚖ 563 KB

On error behaviour of partitioned linear

On error behaviour of partitioned linearly implicit runge-kutta methods for stiff and differential algebraic systems

✍ K. Strehmel; R. Weiner; I. Dannehl 📂 Article 📅 1990 🏛 Springer Netherlands 🌐 English ⚖ 751 KB

Improving Rates of Convergence of Iterat

Improving Rates of Convergence of Iterative Schemes for Implicit Runge-Kutta Methods

✍ R. Vigneswaran 📂 Article 📅 2004 🏛 John Wiley and Sons ⚖ 157 KB 👁 1 views

Some linear stability results for iterat

Some linear stability results for iterative schemes for implicit Runge-Kutta methods

✍ G. J. Cooper 📂 Article 📅 1996 🏛 Springer Netherlands 🌐 English ⚖ 442 KB

A parallelizable preconditioner for the

A parallelizable preconditioner for the iterative solution of implicit Runge–Kutta-type methods

✍ Laurent O. Jay; Thierry Braconnier 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 126 KB

The main di culty in the implementation of most standard implicit Runge-Kutta (IRK) methods applied to (sti ) ordinary di erential equations (ODEs) is to e ciently solve the nonlinear system of equations. In this article we propose the use of a preconditioner whose decomposition cost for a parallel