论文信息 - A Splitting Method for Large Sparse Linear Systems on a Multivector Computer

A Splitting Method for Large Sparse Linear Systems on a Multivector Computer

This paper is concerned with the analysis and implementation on a computer consisting of two vector processors of the Preconditioned Simultaneous Displacements method with an additive preconditioner for solving large sparse systems of linear equations. This method converges for systems with coefficient matrices that are symmetric positive definite or irreducible L-matrices with a strong diagonal dominance.

Ilio Galligani

[1] D. Evans. Preconditioning Methods: Theory and Applications , 1983 .

[2] D. O’Leary,et al. Multi-Splittings of Matrices and Parallel Solution of Linear Systems , 1985 .

[3] Valeria Ruggiero,et al. An iterative method for large sparse linear systems on a vector computer , 1990 .

[4] R. Fletcher. Conjugate gradient methods for indefinite systems , 1976 .

[5] Loyce M. Adams,et al. Additive polynomial preconditioners for parallel computers , 1989, Parallel Comput..

[6] L. Adams. m-Step Preconditioned Conjugate Gradient Methods , 1985 .

[7] S. Eisenstat,et al. Variational Iterative Methods for Nonsymmetric Systems of Linear Equations , 1983 .

[8] Louis A. Hageman,et al. Iterative Solution of Large Linear Systems. , 1971 .

[9] Robert E. White. Multisplitting with different weighting schemes , 1989 .