Incomplete Cholesky factorizations with limited memory

SIAM Journal of Scientific Computing

Volumn 21, Issue 1, 1999, Pages 24-45

  Lin, Chih Jen ^a   Moré, Jorge J ^b  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^b ARGONNE NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONSTRAINT THEORY; DATA STORAGE EQUIPMENT; ITERATIVE METHODS; MATRIX ALGEBRA; OPTIMIZATION; PROBLEM SOLVING;

CHOLESKY FACTORIZATIONS; CONJUGATE GRADIENTS; TRUST REGION;

LINEAR EQUATIONS;

EID: 0033294627     PISSN: 10648275     EISSN: None     Source Type: None    
DOI: 10.1137/S1064827597327334     Document Type: Article

References (45)

1. M. A. AJIZ AND A. JENNINGS, A robust incomplete Cholesky-conjugate gradient algorithm, Internat. J. Numer. Methods. Engrg., 20 (1984), pp. 949-966.
2. B. M. AVERICK, R. G. CARTER, J. J. MORÉ, AND G.-L. XUE, The MINPACK-2 Test Problem Collection, preprint MCS-P153-0694, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, 1992.
3. O. AXELSSON, Iterative Solution Methods, Cambridge University Press, Cambridge, 1994.
4. M. BENZI, C. D. MEYER, AND M. TŮMA, A sparse approximate inverse preconditioner for the conjugate gradient method, SIAM J. Sci. Comput., 17 (1996), pp. 1135-1149.
5. I. BONGARTZ, A. R. CONN, N. I. M. GOULD, AND P. L. TOINT, CUTE: Constrained and unconstrained testing environment, ACM Trans. Math. Software, 21 (1995), pp. 123-160.
6. A. BOUARICHA, J. J. MORÉ, AND Z. WU, Newton's Method for Large-Scale Optimization, Preprint MCS-P635-0197, Argonne National Laboratory, Argonne, IL, 1997.
7. E. CARR, Preconditioning and Performance Issues for the Solution of Ill-Conditioned Three-Dimensional Structural Analysis Problems, Master's thesis, Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada, 1997.
8. S. H. CHENG AND N. J. HIGHAM, A Modified Cholesky Algorithm Based on a Symmetric Indefinite Factorization, Numerical Analysis Report 289, University of Manchester, Manchester, England, April 1996.
9. E. CHOW AND Y. SAAD, Experimental study of ILU preconditioners for indefinite matrices, J. Comput. Appl. Math., 86 (1997), pp. 387-414.
10. A. R. CONN, N. I. M. GOULD, AND P. L. TOINT, LANCELOT, Springer Series in Computational Mathematics, Springer-Verlag, Berlin, New York, 1992.
11. E. F. D'AZEVEDO, P. A. FORSYTH, AND W. P. TANG, Towards a cost effective ILU preconditioned with high level fill, BIT, 32 (1992), pp. 442-463.
12. J. K. DICKINSON AND P. A. FORSYTH, Preconditioned conjugate gradient methods for three-dimensional linear elasticity, Internat. J. Numer. Methods. Engrg., 37 (1994), pp. 2211-2234.
13. I. S. DUFF, R. GRIMES, J. LEWIS, AND B. POOLE, Sparse matrix test problems, ACM Trans. Math. Software, 15 (1989), pp. 1-14.
14. I. S. DUFF AND G. A. MEURANT, The effect of ordering on preconditioned conjugate gradients, BIT, 29 (1989), pp. 635-657.
15. V. EIJKHOUT, Analysis of parallel incomplete point factorizations, Linear Algebra Appl., 154-156 (1991), pp. 723-740.
16. A. FORSGREN, P. E. GILL, AND W. MURRAY, Computing modified Newton directions using a partial Cholesky factorization, SIAM J. Sci. Comput., 16 (1995), pp. 139-150.
17. P. E. GILL, W. MURRAY, D. B. PONCELÉON, AND M. A. SAUNDERS, Preconditioners for indefinite systems arising in optimization, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 292-311.
18. P. E. GILL, W. MURRAY, AND M. H. WRIGHT, Practical Optimization, Academic Press, New York, 1981.
19. K. GOEBEL, Getting more out of your new UltraSPARC™ machine, Sun Developer News, 1 (1996).
20. I. GUSTAFSSON, A class of first order factorization methods, BIT, 18 (1978), pp. 142-156.
21. I. GUSTAFSSON, Modified incomplete Cholesky (MIC) methods, in Preconditioning Methods: Theory and Applications, D. Evans, ed., Gordon and Breach, New York, 1983, pp. 265-293.
22. I. GUSTAFSSON, A class of preconditioned conjugate gradient methods applied to the finite element equations, in Preconditioning Conjugate Gradient Methods, O. Axelsson and L. Y. Koltilina, eds., Springer-Verlag, Berlin, New York, 1990, pp. 44-57.
23. W. HACKBUSCH, Iterative Solution of Large Sparse Systems of Equations, Applied Mathematical Sciences 95, Springer-Verlag, Berlin, New York, 1994.
24. I. HLADÍK, M. B. REED, AND G. SWOBODA, Robust preconditioners for linear elasticity FEM analysis, Internat. J. Numer. Methods Engrg., 40 (1997), pp. 2109-2117.
25. A. JENNINGS AND G. M. MALIK, Partial elimination, J. Inst. Math. Appl., 20 (1977), pp. 307-316.
26. M. T. JONES AND P. E. PLASSMANN, An improved incomplete Cholesky factorization, ACM Trans. Math. Software, 21 (1995), pp. 5-17.
27. T. A. MANTEUFFEL, Shifted incomplete Cholesky factorization, in Sparse Matrix Proceedings 1978, SIAM, Philadelphia, 1978, pp. 41-61.
28. T. A. MANTEUFFEL, An incomplete factorization technique for positive definite linear systems, Math. Comp., 34 (1980), pp. 307-327.
29. J. A. MEIJERINK AND H. A. VAN DER VORST, An iterative solution method for linear equations systems of which the coefficient matrix is a symmetric M-matrix, Math. Comp., 31 (1977), pp. 148-162.
30. J. A. MEIJERINK AND H. A. VAN DER VORST, Guidelines for the usage of incomplete decompositions in solving sets of linear equations as they occur in practical problems, J. Comput. Phys., 44 (1981), pp. 134-155.
31. J. J. MORÉ AND D. C. SORENSEN, Computing a trust region step, SIAM J. Sci. Statist. Comput., 4 (1983), pp. 553-572.
32. N. MUNKSGAARD, Solving sparse symmetric sets of linear equations by preconditioned conjugate gradients, ACM Trans. Math. Software, 6 (1980), pp. 206-219.
33. A. NEUMAIER, On Satisfying Second-Order Optimality Conditions Using Modified Cholesky Factorizations, Tech. report, Universitat Wien, Vienna, Austria, 1997.
34. J. M. ORTEGA, Introduction to Parallel and Vector Solution of Linear Systems, Plenum Press, New York, 1988.
35. F. RENDEL AND H. WOLKOWICZ, A semidefinite framework for trust region subproblems with applications to large scale minimization, Math. Programming, 77 (1997), pp. 273-299.
36. Y. SAAD, ILUT: A dual threshold incomplete LU factorization, Numer. Linear Algebra Appl., 4 (1994), pp. 387-402.
37. Y. SAAD, Iterative Methods for Sparse Linear Systems, PWS Publishing Company, Boston, 1996.
38. S. A. SANTOS AND D. C. SORENSEN, A New Matrix-Free Algorithm for the Large-Scale Trust-Region Subproblem, Technical report TR95-20, Rice University, Houston, TX, 1995.
39. T. SCHLICK, Modified Cholesky factorizations for sparse preconditioners, J. Sci. Comput., 14 (1993), pp. 424-445.
40. R. B. SCHNABEL AND E. ESKOW, A new modified Cholesky factorization, SIAM J. Sci. Statist. Comput., 11 (1990), pp. 1136-1158.
41. M. K. SEAGER, A SLAP for the Masses, Technical report UCRL-100267, Lawrence Livermore National Laboratory, Livermore, CA, December 1988.
42. D. C. SORENSEN, Minimization of a large-scale quadratic function subject to a spherical constraint, SIAM J. Optim, 7 (1997), pp. 141-161.
43. T. STEIHAUG, The conjugate gradient method and trust regions in large scale optimization, SIAM J. Numer. Anal., 20 (1983), pp. 626-637.
44. D. E. STEWART AND Z. LEYK, Meschach: Matrix computations in C, Proceedings of the Center of Mathematics and Its Application 32, Austrian National University, Canberra, Australia, 1994.
45. D. P. YOUNG, R. G. MELVIN, F. T. JOHNSON, J. E. BUSSOLETTI, L. B. WIGTON, AND S. S. SAMANT, Application of sparse matrix solvers as effective preconditioners, SIAM J. Sci. Statist. Comput., 10 (1989), pp. 1186-1199.