A parallelizable preconditioner for the iterative solution of implicit Runge-Kutta-type methods (Q1964103)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:1964103 |
scientific article; zbMATH DE number 1398819
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A parallelizable preconditioner for the iterative solution of implicit Runge-Kutta-type methods |
scientific article; zbMATH DE number 1398819 |
Statements
A parallelizable preconditioner for the iterative solution of implicit Runge-Kutta-type methods (English)
0 references
1999
0 references
This article is concerned with the implementation of implicit Runge-Kutta (RK) methods such as those based on Gauss, Radon and Lobatto points applied to (stiff) ordinary differential equations. The use of a preconditioner, whose decomposition cost for parallel implementation is equivalent to the cost for the implicit-Euler method, is proposed. The preconditioner is based on the \(W\)-transformation of the RK coefficient-matrices. At the end numerical results are presented.
0 references
Gauss points
0 references
Radon points
0 references
Lobatto points
0 references
stiff equations
0 references
parallel computation
0 references
implicit Runge-Kutta methods
0 references
preconditioner
0 references
implicit-Euler method
0 references
\(W\)-transformation
0 references
numerical results
0 references
0 references
0 references
0 references
0.847133994102478
0 references
0.8332021832466125
0 references
0.8270263075828552
0 references
0.8269851803779602
0 references
0.8245975971221924
0 references
