An out-of-core sparse symmetric-indefinite factorization method

ACM Transactions on Mathematical Software

Volumn 32, Issue 3, 2006, Pages 445-471

  Meshar, Omer ^a   Irony, Dror ^a   Toledo, Sivan ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Out of Core; Symmetric indefinite

Indexed keywords

COMPUTATIONAL RATES; DYNAMIC PARTITIONING; FACTORIZATION METHOD;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; TELECOMMUNICATION TRAFFIC;

MATHEMATICAL PROGRAMMING;

EID: 33749334130     PISSN: 00983500     EISSN: 00983500     Source Type: Journal    
DOI: 10.1145/1163641.1163645     Document Type: Article

References (29)

1. AMESTOY, P. R., DUFF, I. S., KOSTER, J., AND L'EXCELLENT, J. 2001. A fully asynchronous multifrontal solver using distributed dynamic scheduling. SIAM J. Matrix Anal. Appl. 23, 15-41.
2. AMESTOY, P. R., DUFF, I. S., L'EXCELLENT, J., AND KOSTER, J. 2003. MUltifrontal massively parallel solver (MUMPS version 4.3) user's guide. Available online from http://www.enseeiht.lr/lima/apo/MUMPS/doc.html.
3. AMESTOY, P. R., DUFF, I. S., AND L'EXCELLENT, J.-Y. 2000. Multifrontal parallel distributed symmetric and unsymmetric solvers. Computer Methods Appl. Mechanics Eng. 184, 501-520.
4. ASHCRAFT, C. AND GRIMES, R. 1999. SPOOLES: An object-oriented sparse matrix library. In Proceedings of the 9th SIAM Conference on Parallel Processing for Scientific Computing San Antonio, Tx. 10 pages on CD-ROM.
5. ASHCRAFT, C., GRIMES, R. G., AND LEWIS, J. G. 1998. Accurate symmetric indefinite linear equation solvers. SIAM J. Matrix Anal. Appl. 20, 513-561.
6. BUNCH, J. R. AND KAUFMAN, L. 1977. Some stable methods for calculating inertia and solving symmetric indefinite linear systems. Math. Comput. 31, 163-179.
7. BUNCH, J. R., KAUFMAN, L., AND PARLETT, B. N. 1976. Decomposition of a symmetric matrix. Numer. Math. 27, 95-109.
8. DOBRIAN, F. AND POTHEN, A. 2006. Oblio: Design and performance. In Applied Parallel Computing: State-of-the-Art in Scientific Computing; Proceedings of the 7th International Workshop (PARA 2004) Lyngby, Denmark, held in June 2004. Lecture Notes in Computer Science, vol. 3732. Springer Verlag, 758-767.
9. DUFF, I. AND REID, J. 1983a. The multitrontal solution of indefinite sparse symmetric linear equations. ACM Trans. Math. Softw. 9, 302-325.
10. DUFF, I. S., ERISMAN, A. M., AND REID, J. K. 1986. Direct Methods for Sparse Matrices. Oxford University Press, Oxford, UK.
11. DUFF, I. S. AND REID, J. K. 1982. MA27: A set of Fortran subroutines for solving sparse symmetric sets of linear equations. Tech. Rep. AERE R10533, AERE Harwell, Didcot, Oxon, UK.
12. DUFF, I. S. AND REID, J. K. 1983b. The multifrontal solution of indefinite sparse symmetric linear systems. ACM Trans. Math. Softw. 9, 302-325.
13. DUFF, I. S. AND SCOTT, J. A. 1999. A frontal code for the solution of sparse positive-definite symmetric systems arising from finite-element applications. ACM Trans. Math. Soft. 25, 4 (Dec.), 404-424.
14. GILBERT, J. R. AND TOLEDO, S. 1999. High-Performance out-of-core sparse LU factorization. In Proceedings of the 9th SIAM Conference on Parallel Processing for Scientific Computing San Antonio, Tx. 10 pages on CDROM.
15. GOULD, N. I. M. AND SCOTT, J. A. 2004. A numerical evaluation of HSL packages for the direct solution of large sparse, symmetric linear systems of equations. ACM Trans. Math. Soft. 30, 3 (Sept.), 300-325.
16. HIGHAM, N. J. 2002. Accuracy and Stability of Numerical Algorithms, 2nd ed. Society for Industrial and Applied Mathematics, Philadelphia, PA.
17. IRONS, B. M. 1970. A frontal solution scheme for finite element analysis. Int. J. Numeri. Methods Eng. 2, 5-32.
18. KARYPIS, G. AND KUMAR, V. 1998. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20, 359-392.
19. LIU, J. W. H. 1990. The role of elimination trees in sparse factorization. SIAM J. Matrix Anal. Appl. 11, 134-172.
20. LIU, J. W. H. 1992. The multifrontal method for sparse matrix solution: Theory and practice. SIAM Rev. 34, 1, 82-109.
21. NATANZON, A., SHAMIR, R., AND SHARAN, R. 1998. A polynomial approximation algorithm for the minimum fill-in problem. In Proceedings of the 13th Annual ACM Symposium on Theory of Computing (STOC '98). ACM Press, New York, 41-47.
22. NG, E. G. AND PEYTON, B. W. 1993. Block sparse Cholesky algorithms on advanced uniprocessor computers. SIAM J. Sci. Comput. 14, 5, 1034-1056.
23. RÖLLIN, S. AND SCHENK, O. 2006. Maximum-weighted matching strategies and the application to symmetric indefinite systems. In Applied Parallel Computing: State-of-the-Art in Scientific Computing; Proceedings of the 7th International Workshop (PARA 2004), Lyngby, Denmark, held in June 2004. Lecture Notes in Computer Science, vol. 3732. Springer Verl. 808-817.
24. ROTHBERG, E. AND GUPTA, A. 1991. Efficient sparse matrix factorization on high-performance workstations - Exploiting the memory hierarchy. ACM Trans. Math. Softw. 17, 3, 313-334.
25. ROTHBERG, E. AND SCHREIBER, R. 1999. Efficient methods for out-of-core sparse Cholesky factorization. SIAM J. Sci. Comput. 21, 129-144.
26. ROTKIN, V. AND TOLEDO, S. 2004. The design and implementation of a new out-of-core sparse Cholesky factorization method. ACM Trans. Math. Softw. 30, 1, 19-46.
27. SCHENK, O. AND GÄRTNER, K. 2004. On fast factorization pivoting methods for sparse symmetric indefinite systems. Tech. Rep. CS-2004-004, Department of Computer Science, University of Basel. Submitted to Electro. Trans. Numer. Anal.
28. SCHREIBER, R. 1982. A new implementation of sparse Gaussian elimination. ACM Trans. Math. Softw. 8, 256-276.
29. STEWART, G. W. 2001. Matrix Algorithms, vol. 2: Eigensystems. SIAM, Philadelphia, PA.