Preconditioners for least squares problems by lu factorization

Electronic Transactions on Numerical Analysis

Volumn 8, Issue , 1999, Pages 26-35

  Bjorck A ^a   Yuan, J Y ^b  

^a LINKÖPING UNIVERSITY   (Sweden)

^b FEDERAL UNIVERSITY OF PARANÁ   (Brazil)

Author keywords

Conjugate gradient method; Linear least squares; Lu factorization; Preconditioner

Indexed keywords

EID: 0002309803     PISSN: 10689613     EISSN: 10689613     Source Type: Journal    
DOI: None     Document Type: Article

References (20)

1. J. L. BARLOW, N. K. NICHOLS AND R. J. PLEMMONS. Iterative methods for equality-constrained least squares problems, SIAM J. Sci. Statist. Comput., 9 (1988), 892-906.
2. A. BJÖRCK, Numerical Methods for Least Squares Problems, in Frontiers in Applied Mathematics, SIAM, 1996.
3. A. BJÖRCK, T. ELFVING AND Z. STRAKOS, Stability of conjugate gradient and Lanczos methods for linear least squares problems, SIAM. J. Matrix Anal. Appl., 19 (1998), 720-736.
4. Y. T. CHEN, Iterative methods for linear least squares problems, Technical Report CS-75-04, University of Waterloo, Canada, 1975.
5. I. S. DUFF, R. G. GRIMES AND J. G. LEWIS, User's guide for Harwell-Boeing sparse matrix test problems collection, Technical Report RAL-92-086, Rutherford Appleton Laboratory, 1992.
6. D. J. EVANS AND C. Li, Numerical aspects of the generalized cg-method applied to least squares problems, Computing, 41 (1989), 171-178.
7. _, The theoretical aspects of the gcg-method applied to least-squares problems, Inter. J. Comput. Math., 35 (1990), 207-229.
8. R. FREUND, A note on two block SOR methods for sparse least squares problems, Linear Algebra Appl., 88/89(1987), 211-221.
9. J. R. GILBERT AND T. PEIERLS, Sparse partial pivoting in time proportional to arithmetic operations, SIAM J. Sci. Statist. Comput., 9 (1988), 862-874.
10. T Ax = b, SIAM J. Sci. Statist. Cornput., 5 (1984), 978-987.
11. P. LÄUCHLI, Jordan-Elimination und Ausgleichung nach kleinsten Quadraten, Numer. Math., 3 (1961), 226-240.
12. T. L. MARKHAM, M. NEUMANN AND R. J. PLEMMONS, Convergence of a direct-iterative method for large-scale least-squares problems, Linear Algebra Appl., 69 (1985), 155-167.
13. W. NIETHAMMER, J. DE PILLIS AND R. S. VARGA, Convergence of block iterative methods applied to sparse least-squares problems, Linear Algebra Appl., 58 (1984), 327-341.
14. C. C. PAIGE, Fast numerically stable computations for generalized least squares problems, SIAM J. Numer. Anal., 16(1979), 165-171.
15. E. P. PAPADOPOULOU, Y. G. SARIDAKIS AND T. S. PAPATHEODOROU, Block AOR iterative schemes for large-scale least-squares problems, SIAM J. Numer. Anal., 26 (1989), 637-660.
16. M. A. SAUNDERS, Sparse least squares by conjugate gradients: a comparison of preconditioning methods, in Proceedings of Computer Science and Statistics: Twelfth Annual Conference on the Interface, Waterloo, Canada, 1979.
17. J.-Y. YUAN, The convergence of the 2-block SAOR method for the least-squares problem, Appl. Numer. Math., 11 (1993), 429-441.
18. _, Iterative Methods for the Generalized Least-Squares Problem, Ph.D. thesis, Institute de Matemática Pura e Aplicada, Rio de Janeiro, Brazil, 1993.
19. _, Numerical methods for generalized least-squares problems, J. Comp. Appl. Math., 66 (1996), 571-584.
20. J.-Y. YUAN AND A.-N. lUSEM, Preconditioned conjugate gradient method for generalized least squares problems, J. Comp. Appl. Math., 71 (1996), 287-297.