A robust preconditioner with low memory requirements for large sparse least squares problems

SIAM Journal on Scientific Computing

Volumn 25, Issue 2, 2003, Pages 499-512

  Benzi, Michele ^a   Tůma, Miroslav ^b  

^a EMORY UNIVERSITY   (United States)

^b INSTITUTE OF COMPUTER SCIENCE   (Czech Republic)

Author keywords

Incomplete C orthogonalization; Incomplete QR; Large sparse least squares problems; Preconditioned CGLS; Robust incomplete factorization

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; ITERATIVE METHODS; MATRIX ALGEBRA; PROBLEM SOLVING; VECTORS;

INCOMPLETE C-ORTHOGONALIZATION; INCOMPLETE QR; LARGE SPARSE LEAST SQUARES PROBLEMS; PRECONDITIONED CGLS; ROBUST INCOMPLETE FACTORIZATION;

LEAST SQUARES APPROXIMATIONS;

EID: 2342529812     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S106482750240649X     Document Type: Conference Paper

References (31)

1. Z. Z. BAI, L S. DUFF, AND A. J. WATHEN, A class of incomplete orthogonal factorization methods. I: Methods and theories, BIT, 41 (2001), pp. 53-70.
2. M. BENZI, J. K. CULLUM, AND M. TŮMA, Robust approximate inverse preconditioning for the conjugate gradient method, SIAM J. Sci. Comput., 22 (2000), pp. 1318-1332.
3. M. BENZI AND M. TŮMA, A comparison of some preconditioning techniques for general sparse matrices, in Iterative Methods in Linear Algebra, II, S. D. Margenov and P. S. Vassilevski, eds., IMACS Ser. Comput. Appl. Math., IMACS, New Brunswick, NJ, 1996, pp. 191-203.
4. M. BENZI AND M. TŮMA, A robust incomplete factorization preconditioner for positive definite matrices, Numer. Linear Algebra Appl., to appear.
5. A. BJÖRCK, Numerical Methods for Least Squares Problems, SIAM, Philadelphia, 1996.
6. A. BJÖRCK AND J. Y. YUAN, Preconditioned for least squares problems by LU factorization, Electron. Trans. Numer. Anal., 8 (1997), pp. 26-35.
7. I. S. DUFF AND J. K. REID, The multifrontal solution of indefinite sparse symmetric linear equations, ACM Trans. Math. Software, 9 (1983), pp. 302-325.
8. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 3rd ed., Johns Hopkins University Press, Baltimore and London, 1996.
9. J. C. HAWS, Preconditioning KKT Systems, Ph.D. thesis, Department of Mathematics, North Carolina State University, Raleigh, NC, 2002.
10. M. HEGLAND, On the computation of breeding values, in Proceedings of CONPAR 90-VAPP IV Joint International Conference on Vector and Parallel Processing, H. Burkhart, ed., Lecture Notes in Comput. Sci. 457, Springer-Verlag, Berlin, 1990, pp. 232-242.
11. M. HEGLAND, Description and Use of Animal Breeding Data for Large Least Squares Problems, Technical report TR/PA/93/50, CERFACS, Toulouse, France, 1993.
12. A. HOLSTAD AND I. LIE, On the Computation of Mass Conservative Wind and Vertical Velocity Fields, Technical report 141, The Norwegian Meteorological Institute, Oslo, Norway, 2002.
13. TAx = b, SIAM J. Sci. Stat. Comput., 5 (1984), pp. 978-987.
14. TU-decomposition, Numer. Linear Algebra Appl., 5 (1998), pp. 483-509.
15. S. A. KHAROHENKO, L. YU. KOLOTILINA, A. A. NIKISHIN, AND A. YU. YEREMIN, A robust AINV-type method for constructing sparse approximate inverse preconditioned in factored form, Numer. Linear Algebra Appl., 8 (2001), pp. 165-179.
16. C. KELLER, N. I. M. GOULD, AND A. J. WATHEN, Constraint preconditioning for indefinite linear systems, SIAM J. Matrix Anal. Appl., 21 (2000), pp. 1300-1317.
17. P. LÄUCHLI, Jordan-Elimination und Ausgleichung nach kleinsten Quadraten, Numer. Math., 3 (1961), pp. 226-240.
18. National Institute of Standards and Technology, Matrix Market, http://math.nist.gov/MatrixMarket (October 2002).
19. C. C. PAIGE AND M. A. SAUNDERS, LSQR: An algorithm for sparse linear equations and sparse least squares, ACM Trans. Math. Software, 8 (1982), pp. 43-71.
20. A. T. PAPADOPOULOS, I. S. DUFF, AND A. J. WATHEN, Incomplete Orthogonal Factorization Methods Using Givens Rotations. II: Implementation and Results, Report 02/07, Oxford University Computing Laboratory, Oxford, England, 2002.
21. I. PERUGIA AND V. SIMONCINI, Block-diagonal and indefinite symmetric preconditioned for mixed finite element formulations, Numer. Linear Algebra Appl., 7 (2000), pp. 585-616.
22. Y. SAAD, Preconditioning techniques for nonsymmetric and indefinite linear systems, J. Comput. Appl. Math., 24 (1988), pp. 89-105.
23. Y. SAAD AND M. SOSONKINA, Enhanced Preconditioned for Large Sparse Least Squares Problems, Report UMSI-2001-1, Minnesota Supercomputer Institute, University of Minnesota, Minneapolis, MN, 2001.
24. M. A. SAUNDERS, Sparse least squares problems by conjugate gradients: A comparison of preconditioning methods, in Proceedings of Computer Science and Statistics: Twelfth Annual Conference on the Interface, Waterloo, Canada, 1979.
25. I. STRANDÉN, S. TSURUTA, AND I. MISZTAL, Simple preconditioned for the conjugate gradient method: Experience with test day models, J. Anim. Breed. Genet., 119 (2002), pp. 166-174.
26. M. TISMENETSKY, A new preconditioning technique for solving large sparse linear systems, Linear Algebra Appl., 154/156 (1991), pp. 331-353.
27. X. WANG, Incomplete Factorization Preconditioning for Linear Least Squares Problems, Ph.D. thesis, Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL, 1994.
28. X. WANG, K. A. GALLIVAN, AND R. BRAMLEY, CIMGS: An incomplete orthogonal factorization preconditioned, SIAM J. Sci. Comput., 18 (1997), pp. 516-536.
29. S.-L. ZHANG, K. NAKATA, AND M. KOJIMA, Incomplete orthogonalization preconditioned for solving large and dense linear systems which arise from semidefinite programming, Appl. Numer. Math., 41 (2002), pp. 235-245.
30. Z. ZLATEV, Computational Methods for General Sparse Matrices, Kluwer Academic Publishers, Dordrecht/Boston/London, 1991.
31. Z. ZLATEV AND H. B. NIELSEN, Solving large and sparse linear least-squares problems by conjugate gradient algorithms, Comput. Math. Appl., 15 (1988), pp. 185-202.