A stationary iterative pseudoinverse algorithm
- 134 Downloads
Iterative methods applied to the normal equationsA T Ax=A T b are sometimes used for solving large sparse linear least squares problems. However, when the matrix is rank-deficient many methods, although convergent, fail to produce the unique solution of minimal Euclidean norm. Examples of such methods are the Jacobi and SOR methods as well as the preconditioned conjugate gradient algorithm. We analyze here an iterative scheme that overcomes this difficulty for the case of stationary iterative methods. The scheme combines two stationary iterative methods. The first method produces any least squares solution whereas the second produces the minimum norm solution to a consistent system.
AMS subject classification65F10 65F20 65F50
Key wordsStationary iterative methods least squares pseudoinverse solution
Unable to display preview. Download preview PDF.
- 7.T. Elfving,On the conjugate gradient method for solving linear least squares problems, Report LiTH-MAT-R-78-3, Department of Mathematics Linköping University, Linköping, Sweden, 1978.Google Scholar
- 14.R. A. Horn and C. R. Johnson,Matrix Analysis, Cambridge University Press, New York (1990).Google Scholar
- 15.R. J. Plemmons,Stationary iterative methods for linear systems with non-Hermitian singular matrices, Technical Report, Department of Computer Science, The University of Tennessee, Knoxville, TN, 1970.Google Scholar