CIMGS: An incomplete orthogonal factorization preconditioner

SIAM Journal on Scientific Computing

Volumn 18, Issue 2, 1997, Pages 516-536

  Wang, Xiaoge ^a   Gallivan, Kyle A ^a   Bramley, Randall ^a  

^a INDIANA UNIVERSITY   (United States)

Author keywords

Incomplete factorization; Incomplete orthogonalization; Iterative method; Least squares problems; M matrix; Preconditioner; Symmetric positive definite systems

Indexed keywords

COMPRESSED INCOMPLETE MODIFIED GRAM-SCHMIDT PRECONDITIONER; INCOMPLETE ORTHOGONAL FACTORIZATION PRECONDITIONER;

APPROXIMATION THEORY; ERRORS; LEAST SQUARES APPROXIMATIONS; MATRIX ALGEBRA; NUMERICAL METHODS;

MATHEMATICAL TECHNIQUES;

EID: 0031082735     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1064827594268270     Document Type: Article

References (18)

1. S. ASHBY, Polynomial Preconditioning for Conjugate Gradient Methods, Ph.D. thesis, University of Illinois, Urbana-Champaign, Urbana, IL, 1987; Tech. report 1355, Department of Computer Science, University of Illinois, Urbana-Champaign, Urbana, IL.
2. S. ASHBY, Minimax polynomial preconditioning for Hermitian linear systems, SIAM J. Matrix Anal. Appl., 12 (1991), pp. 766-789.
3. M. W. BERRY AND R. J. PLEMMONS, Algorithms and experiments for structural mechanics on high-performance architectures, Comput. Methods Appl. Mech. Engrg., 64 (1987), pp. 487-507.
4. A. BJÖRCK, SSOR preconditioning methods for sparse least squares problems, in Proc. of the Computer Science and Statistics: 12th Annual Symposium on the Interface, J. F. Gentleman, ed., University of Waterloo, Waterloo, Ontario, Canada, May 1979, pp. 21-25.
5. I. CHIO, C. L. MONMA, AND D. SHANNO, further development of a primal-dual interior point method, ORSA J. Comput., 2 (1990), pp. 304-311.
6. E. CHU, A. GEORGE, J. LIU, AND E. NG, SPARSPAK: Waterloo Sparse Matrix Package User's Guide for SPARSPAK-A, Tech. report CS-84-36, Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada, 1984.
7. A. GEORGE AND E. NG, SPARSPAK: Waterloo Sparse Matrix Package, User's Guide for SPARSPAK-B, Tech. report CS-84-37, Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada, 1984.
8. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 2nd ed., The Johns Hopkins University Press, Baltimore, MD, 1989.
9. M. T. HEATH, R. J. PLEMMONS, AND R. C. WARD, Sparse orthogonal schemes for structural optimization using the force method, SIAM J. Sci. Statist. Comput., 5 (1984), pp. 514-532.
10. TAx = b, SIAM J. Sci. Statist. Comput., 5 (1984), pp. 978-987.
11. 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.
12. M. FORTIN AND R. GLOWINSKI, Augmented Lagrangian Methods: Applications to the Numerical Solution of Boundary-Value Problems, North-Holland, Amsterdam, 1983.
13. C. PAIGE AND M. SAUNDERS, LSQR: An algorithm for sparse linear equations and sparse least squares, ACM Trans. Math. Software, 8 (1982), pp. 43-71.
14. Y. SAAD, Preconditioning techniques for nonsymmetric and indefinite linear systems, J. Comput. Appl. Math., 24 (1988), pp. 89-105.
15. Y. SAAD, SPARSKIT: A Basic Tool Kit for Sparse Matrix Computations, Tech. report, Center for Supercomputing Research and Development, University of Illinois, Urbana-Champaign, Urbana, IL, 1990.
16. X. WANG, Incomplete Factorization Preconditioning for Linear Least Squares Problems, Ph.D. thesis, University of Illinois, Urbana-Champaign, Urbana, IL, 1993; Tech. report UIUCDCS-R-93-1834, Department of Computer Science, University of Illinois, UrbanaChampaign. Urbana, IL.
17. J. H. WILKINSON, A priori error analysis of algebraic processes, in Proc. International Congress of Mathematicians, Moscow: Izdat. Mir, 1968, pp. 119-129.
18. Z. ZLATEV AND H. B. NIELSON, Solving large and sparse linear least squares problems by conjugate gradient algorithm, Comput. Math. Appl., 15 (1988), pp. 185-202.