Analysis of Projection Methods for Solving Linear Systems with Multiple Right-Hand Sides

We analyze a class of Krylov projection methods but mainly concentrate on a specific conjugate gradient (CG) implementation by Smith, Peterson, and Mittra [IEEE Transactions on Antennas and Propogation, 37 (1989), pp. 1490--1493] to solve the linear system AX=B, where A is symmetric positive definite and B is a multiple of right-hand sides. This method generates a Krylov subspace from a set of direction vectors obtained by solving one of the systems, called the seed system, by the CG method and then projects the residuals of other systems orthogonally onto the generated Krylov subspace to get the approximate solutions. The whole process is repeated with another unsolved system as a seed until all the systems are solved. We observe in practice a superconvergence behavior of the CG process of the seed system when compared with the usual CG process. We also observe that only a small number of restarts is required to solve all the systems if the right-hand sides are close to each other. These two features together make the method particularly effective. In this paper, we give theoretical proof to justify these observations. Furthermore, we combine the advantages of this method and the block CG method and propose a block extension of this single seed method.

[1]  Charbel Farhat,et al.  Implicit parallel processing in structural mechanics , 1994 .

[2]  George Finlay Simmons,et al.  Introduction to Topology and Modern Analysis , 1963 .

[3]  R. Mittra,et al.  A conjugate gradient algorithm for the treatment of multiple incident electromagnetic fields , 1989 .

[4]  M. Papadrakakis,et al.  A new implementation of the Lanczos method in linear problems , 1990 .

[5]  Andy A. Nikishin,et al.  Variable Block CG Algorithms for Solving Large Sparse Symmetric Positive Definite Linear Systems on Parallel Computers, I: General Iterative Scheme , 1995, SIAM J. Matrix Anal. Appl..

[6]  Y. Saad,et al.  On the Lánczos method for solving symmetric linear systems with several right-hand sides , 1987 .

[7]  Gene H. Golub,et al.  Matrix computations , 1983 .

[8]  Efstratios Gallopoulos,et al.  An Iterative Method for Nonsymmetric Systems with Multiple Right-Hand Sides , 1995, SIAM J. Sci. Comput..

[9]  D. O’Leary.  The block conjugate gradient algorithm and related methods , 1980 .

[10]  Y. Saad.  On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods , 1980 .

[11]  H. V. D. Vorst,et al.  The rate of convergence of Conjugate Gradients , 1986 .

[12]  Charles Frederick Smith.  The Performance of Preconditioned Iterative Methods in Computational Electromagnetics , 1987 .

[13]  B. Parlett.  A new look at the Lanczos algorithm for solving symmetric systems of linear equations , 1980 .

[14]  Paul Fischer,et al.  PROJECTION TECHNIQUES FOR ITERATIVE SOLUTION OF Ax = b WITH SUCCESSIVE RIGHT-HAND SIDES , 1993 .

[15]  H. V. D. Vorst,et al.  An iterative solution method for solving f ( A ) x = b , using Krylov subspace information obtained for the symmetric positive definite matrix A , 1987 .

[16]  B. Parlett.  The Symmetric Eigenvalue Problem , 1981 .