A Krylov multisplitting algorithm for solving linear systems of equations
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.
scientific article; zbMATH DE number 540054
scientific article