On the Lánczos method for solving symmetric linear systems with several righthand sides
HTML articles powered by AMS MathViewer
 by Youcef Saad PDF
 Math. Comp. 48 (1987), 651662 Request permission
Abstract:
This paper analyzes a few methods based on the Lanczos algorithm for solving large sparse symmetric linear systems with several righthand sides. The methods examined are suitable for the situation when the right sides are not too different from one another, as is often the case in timedependent or parameterdependent problems. We propose a theoretical error bound for the approximation obtained from a projection process onto a Krylov subspace generated from processing a previous righthand side.References

E. Carnoy & M. Geradin, On the Practical Use of the Lanczos Algorithm in Finite Element Applications to Vibration and Bifurcation Problems, Proc. Conf. on Matrix Pencils, held at Lulea, Sweden, March 1982 (Axel Ruhe, ed.), University of Umea, SpringerVerlag, New York, 1982, pp. 156176.
R. Chandra, Conjugate Gradient Methods for Partial Differential Equations, Ph.D. Thesis, Computer Science Dept., Yale University, 1978.
 C. W. Gear and Y. Saad, Iterative solution of linear equations in ODE codes, SIAM J. Sci. Statist. Comput. 4 (1983), no. 4, 583–601. MR 725654, DOI 10.1137/0904040
 Alston S. Householder, The theory of matrices in numerical analysis, Blaisdell Publishing Co. [Ginn and Co.], New YorkTorontoLondon, 1964. MR 0175290 D. G. Luenberger, Introduction to Linear and Nonlinear Programming, AddisonWesley, Reading, Mass., 1965.
 Dianne P. O’Leary, The block conjugate gradient algorithm and related methods, Linear Algebra Appl. 29 (1980), 293–322. MR 562766, DOI 10.1016/00243795(80)902475
 C. C. Paige and M. A. Saunders, Solutions of sparse indefinite systems of linear equations, SIAM J. Numer. Anal. 12 (1975), no. 4, 617–629. MR 383715, DOI 10.1137/0712047
 Beresford N. Parlett, The symmetric eigenvalue problem, PrenticeHall Series in Computational Mathematics, PrenticeHall, Inc., Englewood Cliffs, N.J., 1980. MR 570116
 B. N. Parlett, A new look at the Lanczos algorithm for solving symmetric systems of linear equations, Linear Algebra Appl. 29 (1980), 323–346. MR 562767, DOI 10.1016/00243795(80)902487
 Y. Saad, Krylov subspace methods for solving large unsymmetric linear systems, Math. Comp. 37 (1981), no. 155, 105–126. MR 616364, DOI 10.1090/S00255718198106163646
 Youcef Saad, Practical use of some Krylov subspace methods for solving indefinite and nonsymmetric linear systems, SIAM J. Sci. Statist. Comput. 5 (1984), no. 1, 203–228. MR 731892, DOI 10.1137/0905015 Y. Saad & A. Sameh, A Parallel Block Stiefel Method for Solving Positive Definite Systems, Proceedings of the Elliptic Problem Solver Conference (M. H. Schultz, ed.), Los Alamos Scientific Laboratory, Academic Press, New York, 1980, pp. 405412. Y. Saad & A. Sameh, Iterative Methods for the Solution of Elliptic Differential Equations on Multiprocessors, Proceedings of the CONPAR 81 Conference (Wolfgang Handler, ed.), SpringerVerlag, New York, 1981, pp. 395411.
 Youcef Saad and Martin H. Schultz, Conjugate gradientlike algorithms for solving nonsymmetric linear systems, Math. Comp. 44 (1985), no. 170, 417–424. MR 777273, DOI 10.1090/S00255718198507772739
 Horst D. Simon, The Lanczos algorithm with partial reorthogonalization, Math. Comp. 42 (1984), no. 165, 115–142. MR 725988, DOI 10.1090/S0025571819840725988X H. A. van der Vorst, An Iterative Method for Solving $f(A)x = b$ Using cgInformation Obtained for the Symmetric Positive Definite Matrix A, Technical Report 8532, Delft University of Technology, Mathematics and Informatics, 1985.
Additional Information
 © Copyright 1987 American Mathematical Society
 Journal: Math. Comp. 48 (1987), 651662
 MSC: Primary 65F10; Secondary 65F50
 DOI: https://doi.org/10.1090/S00255718198708786973
 MathSciNet review: 878697