A Krylov multisplitting algorithm for solving linear systems of equations (Q1318212)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Krylov multisplitting algorithm for solving linear systems of equations |
scientific article |
Statements
A Krylov multisplitting algorithm for solving linear systems of equations (English)
0 references
27 March 1994
0 references
The Krylov subspace methods (conjugate gradients, GMRES, etc.) for parallel computers are analysed in cases where the preconditioning matrix arises from multisplitting. The algorithm is effectively divided into tasks that generate search directions and a single task minimizing over the resulting subspaces. The convergence properties of various forms of the algorithm are examined, and numerical examples are given.
0 references
conjugate gradients
0 references
Krylov subspace methods
0 references
GMRES
0 references
parallel computers
0 references
preconditioning
0 references
multisplitting
0 references
convergence
0 references
numerical examples
0 references
0 references
0 references
