An incomplete cholesky factorization for dense symmetric positive definite matrices

BIT Numerical Mathematics

Volumn 40, Issue 3, 2000, Pages 536-558

  Lin, Chih Jen ^a   Saigal, Romesh ^b  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^b UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Conjugate gradient methods; Dense linear systems; Incomplete cholesky factorization

Indexed keywords

EID: 0042185149     PISSN: 00063835     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1022323931043     Document Type: Article

References (40)

1. F. Alizadeh, J.-P. A. Haeberly, and M. L. Overton, Primal-dual interior-point methods for semidefinite programming: Convergence rates, stability and numerical results, SIAM J. Optim., 8 (1998), pp. 746-768.
2. G. Alléon, M. Benzi, and L. Giraud, Sparse approximate inverse preconditioning for dense linear systems arising in computational electromagnetics, Numer. Algorithms, 16 (1997), pp. 1-15.
3. O. Axelsson, Iterative Solution Methods, Cambridge University Press, 1994.
4. M. Benzi, R. Kouhia, and M. Tuma, An assessment of some preconditioning techniques in shell problems, Comm. Numer. Methods Engrg., 14 (1998), pp. 897-906.
5. R. Burkard, S. Karisch, and F. Rendl, QAPLIB - A quadratic assignment problem library, Tech. Report, Department of Mathematics, Graz University of Technology, Graz, Austria, 1996.
6. C. Cortes and V. Vapnik, Support-vector network, Machine Learning, 20 (1995), pp. 273-297.
7. A. Edelman, Large dense numerical linear algebra in 1993: The parallel computing influence, International J. Supercomputer Appl., 7 (1993), pp. 113-128.
8. K. Goebel, Getting more out of your new UltraSPARC™ machine, Sun Developer News, 1 (1996).
9. G. H. Golub and C. F. Van Loan, Matrix Computations, 2nd ed., The Johns Hopkins University Press, Baltimore, MD1989.
10. S. A. Goreinov, E. E. Tyrtyshnikov, and A. Y. Yeremin, Matrix-free iterative solution strategies for large dense linear systems, Numer. Linear Algebra Appl., 4 (1997), pp. 273-294.
11. A. Greenbaum, L. Greengard, and G. B. McFadden, Laplace's equation and the Dirichlet-Neumann map in multiply connected domains, J. Comp. Phys., 105 (1993), pp. 267-278.
12. I. Gustafsson, A class of first order factorization methods, BIT, 18 (1978), pp. 142-156.
13. T. Joachims, Making large-scale svm learning practical, in Advances in Kernel Methods - Support Vector Learning, B. Schölkopf, C. J. C. Burges, and A. J. Smola, eds., MIT Press, Cambridge, MA, 1998.
14. M. T. Jones and P. E. Plassmann, An improved incomplete Cholesky factorization, ACM Trans. Math. Software, 21 (1995), pp. 5-17.
15. D. S. Kershaw, The incomplete Cholesky-conjugate gradient method for the iterative solution of system of linear equations, J. Comp. Phys., 26 (1978), pp. 43-65.
16. L. Y. Kolotilina, Explicit preconditioning of systems of linear algebraic equations with dense matrices, J. Sov. Math., 43 (1988), pp. 2566-2573. English translation of a paper first published in Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, 154:90-100, 1986.
17. L. Y. Kolotilina, Explicit preconditioning of systems of linear algebraic equations with dense matrices, J. Sov. Math., 43 (1988), pp. 2566-2573. English translation of a paper first published in Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, 154:90-100, 1986.
18. C.-J. Lin, Preconditioning dense linear systems from large-scale semidefinite programming problems, in Proceeding of the Fifth Copper Mountain Conference on Iterative Methods, 1998.
19. C.-J. Lin and J. J. Moré, Incomplete Cholesky factorizations with limited memory, SIAM J. Sci. Comput., 21 (1999), pp. 24-45.
20. C.-J. Lin and R. Saigal, An infeasible start predictor corrector method for semi-definite linear programming. Tech. Report, Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, MI 48109-2117, 1995.
21. T. A. Manteuffel, Shifted incomplete Cholesky factorization, in Sparse Matrix Proceedings, SIAM, Philadelphia, 1979, pp. 41-61.
22. T. A. Manteuffel, An incomplete factorization technique for positive definite linear systems, Math. Comp., 34 (1980), pp. 307-327.
23. 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.
24. D. Michie, D. J. Spiegelhalter, and C. C. Taylor, Machine Learning, Neural and Statistical Classification, Prentice-Hall, Englewood Cliffs, NJ, 1994. Data available at anonymous ftp: ftp.ncc.up.pt/pub/statlog/.
25. N. Munksgaard, Solving sparse symmetric sets of linear equations by preconditioned conjugate gradients, ACM Trans. Math. Software, 6 (1980), pp. 206-219.
26. R. Natarajan, An iterative scheme for dense, complex-symmetric, linear systems in acoustics boundary-element computations, SIAM J. Sci. Comput., 19 (1998), pp. 1450-1470.
27. J. M. Ortega, Introduction to Parallel and Vector Solution of Linear Systems, Plenum Press, New York, 1988.
28. E. Osuna, R. Freund, and F. Girosi, Training support vector machines: An application to face detection, in Proceedings of CVPR'97, 1997.
29. J. C. Platt, Fast training of support vector machines using sequential minimal optimization, in Advances in Kernel Methods-Support Vector Learning, B. Schölkopf, C. J. C. Burges, and A. J. Smola, eds., MIT Press, Cambridge, MA, 1998.
30. J. Rahola, Solution of dense systems of linear equations in the discrete-dipole approximation, SIAM J. Sci. Comput., 17 (1994), pp. 78-89.
31. V. Rokhlin, Rapid solution of integral equations of classical potential theory, J. Comput. Phys., 60 (1985), pp. 187-207.
32. Y. Saad, SPARSKIT: A basic tool kit for sparse matrix computations, Tech. Report, Computer Science Department, University of Minnesota, Minneapolis, MN 55455, 1994.
33. Y. Saad, Iterative Methods for Sparse Linear Systems, PWS Publishing Company, Boston, MA, 1996.
34. The MathWorks, Inc., MATLAB User Guide, Natick, MA 01760-1500, 1998.
35. L. Vandenberghe and S. Boyd, Semidefinite programming, SIAM Rev., 38 (1996), pp. 49-95.
36. V. Vapnik, The Nature of Statistical Learning Theory, Springer-Verlag, New York, NY, 1995.
37. S. A. Vavasis, Preconditioning for boundary integral equations, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 905-925.
38. J. W. Watts III, A conjugate graduent-truncated direct method for the iterative solution of the reservoir simulation pressure equation. Soc. Pet. Eng. J., 21 (1981), pp. 345-353.
39. S. J. Wright, Primal-Dual Interior-Point Methods, SIAM, Philadelphia, PA, 1996.
40. Q. Zhao, S. E. Karisch, F. Rendl, and H. Wolkowicz, Semidefinite programming relaxations for the quadratic assignment problem, Tech. Report, Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, N2L 3G1 Canada, 1996.