A class of incomplete orthogonal factorization methods. II: Implementation and results

BIT Numerical Mathematics

Volumn 45, Issue 1, 2005, Pages 159-179

  Papadopoulos, A T ^a   Duff, I S ^b   Wathen, A J ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b RUTHERFORD APPLETON LABORATORY   (United Kingdom)

Author keywords

Givens rotations; Incomplete orthogonal factorizations; Iterative methods; Preconditioning; Sparse least squares; Sparse linear systems

Indexed keywords

EID: 33644601287     PISSN: 00063835     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10543-005-2642-z     Document Type: Article

References (32)

1. Z. Z. Bai, I. 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. C. Haws, and M. Tůma, Preconditioning highly indefinite and nonsymmetric matrices, SIAM J. Sci. Comp., 22 (2000), pp. 1333-1353.
3. M. Benzi, C. D. Meyer, and M. Tůma, A sparse approximate inverse preconditioner for the conjugate gradient method, SIAM J. Sci. Comp., 17 (1996), pp. 1135-1149.
4. M. Benzi, D. B. Szyld, and A. van Duin, Orderings for incomplete factorization preconditioning of nonsymmetric problems, SIAM J. Sci. Comp., 20 (1999), pp. 1652-1670.
5. M. Benzi and M. Tůma, A robust incomplete factorization preconditioner for positive definite matrices, Numer. Linear Algebra Appl., 99 (2001), pp. 1-20.
6. M. Benzi and M. Tůma, A robust preconditioner with low memory requirements for large sparse least squares problems, SIAM J. Sci. Comp., 25 (2003), pp. 499-512.
7. Å. Björck, Numerical Methods for Least Squares Problems, SIAM, 1996.
8. Å. Björck, T. Elfving, and Z. Strakoš, Stability of conjugate gradient and Lanczos methods for linear least squares problems, SIAM J. Matrix Anal. Appl., 19 (1998), pp. 720-736.
9. Å. Björck and J. Y. Yuan, Preconditioners for least squares problems by LU factorization, Electr. Trans. Numer. Anal., 8 (1999), pp. 26-35.
10. T. Davis, University of Florida Sparse Matrix Collection, available online at http://www.cise.ufl.edu/research/sparse/matrices.
11. I. S. Duff, A. M. Erisman, and J. K. Reid, Direct Methods for Sparse Matrices, Clarendon Press, Oxford, 1986.
12. I. S. Duff and J. Koster, On algorithms for permuting large entries to the diagonal of a sparse matrix, SIAM J. Matrix Anal. Appl., 22 (2001), pp. 973-996.
13. A. George and M. T. Heath, Solution of sparse linear least squares problems using Givens rotations, Lin. Alg. Appl., 34 (1980), pp. 69-83.
14. G. H. Golub and C. F. Van Loan, Matrix Computations, 3rd edn, The Johns Hopkins University Press, Baltimore, MD, 1996.
15. HSL collection of Fortran codes for large scale scientific computation, CCLRC, Chilton, Didcot, OX11 0QX, UK, http://www.cse.clrc.ac.uk/nag/hsl/.
16. D. James, The breakdown of incomplete QR factorizations, Ph.D. thesis appendix, Department of Mathematics and Computer Science, North Carolina State University, Raleigh, NC, 1990.
17. T Ax = b, SIAM J. Sci. Stat. Comp., 5 (1984), pp. 978-987.
18. T. A. Manteuffel, An incomplete factorization technique for positive definite systems, Math. Comp., 34 (1980), pp. 473-497.
19. Matrix Market, NIST, Gaithersburg, MD, available online at http://math.nist.gov/MatrixMarket/data/.
20. J. A. Meijerink and H. A. van der Vorst, An iterative solution method for linear systems of which the coefficient matrix is a symmetric M-matrix, Math. Comp., 31 (1977), pp. 148-162.
21. C. C. Paige and M. A. Saunders, LSQR: An algorithm for sparse linear equations and sparse least squares, ACM Trans. Math. Soft., 8 (1982), pp. 43-71.
22. A. T. Papadopoulos, I. S. Duff, and A. J. Wathen, Incomplete orthogonal factorization methods using Givens rotations II: Implementation and results, Numerical Analysis Group Research Report, 02/07, Oxford University Computing Laboratory, UK, 2002.
23. Y. Saad and M. Schultz, GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems, SIAM J. Sci. Statist. Comput., 7 (1986), pp. 856-869.
24. Y. Saad, Preconditioning techniques for nonsymmetric and indefinite linear systems, J. Comput. Appl. Math., 24 (1988), pp. 89-105.
25. Y. Saad, Iterative Methods for Sparse Linear Systems, PWS Publishing, Boston, 1996.
26. Y. Saad, SPARSKIT: A basic tool kit for sparse matrix computations, version 2, 1999. Source code available at http://www.cs.umn.edu/research/arpa/ SPARSKIT/sparskit.html.
27. M. A. Saunders, Sparse least squares by conjugate gradients: A comparison of preconditioning methods, Proceedings of Computer Science and Statistics: Twelfth Annual Conference on the Interface, Waterloo, Canada, 1979.
28. H. A. van der Vorst, Bi-CGSTAB: A fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems, SIAM J. Sci. Statist. Comput., 13 (1992), pp. 631-644.
29. X. Wang, Incomplete factorization preconditioning for linear least squares problems, Ph.D. thesis, Graduate College of the University of Illinois at Urbana-Champaign, IL, 1993.
30. X. Wang, K. A. Gallivan, and R. Bramley, CIMGS: An incomplete orthogonal factorization preconditioned SIAM J. Sci. Comp., 18 (1997), pp. 516-536.
31. Z. Zlatev, Computational Methods for General Sparse Matrices, Kluwer Acad. Publ., 1991.
32. 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.