- 1 ASHCRAFT, C. C., GRIMES, R. G., LEWIS, J. G., PEYTON, B. W., ANY SrMON, H. D. Recent progress in sparse matrix methods for large linear systems. Int. J. Supercomput. Appl. 1, 4 (Winter 1987), 10-30.Google Scholar
- 2 DONGARRA, J. J., AND EISENSTAT, S C Squeezing the most out of an algorithm in CRAY FORTRAN. ACM Trans. Math. Sofiw. 10, 3 (Sept. 1984), 219-230. Google ScholarDigital Library
- 3 DUFF, I. S., GRIMES, R. G., AND LEWIS, J. G. Sparse matrix test problems. ACM Trans. Math. Sofiw. 15, 1 (Mar. 1989), 1-14. Google ScholarDigital Library
- 4 DUFF, I. S., AND REID, J K The multifrontal solution of indefinite sparse symmetric linear equations. ACM Trans. Math. Sofiw. 9, 3 (Sept. 1983), 302-325. Google ScholarDigital Library
- 5 EISENSTAT, S. C., SCttULTZ, M., AND SHERMAN, A. Algorithms and data structures for sparse symmetric Gaussian elimination. SIAM J. Sc~. Stat. Comput. 2, 2 (June 1981), 225-237.Google Scholar
- 6 GALLIVAN, K., JALBY, W., MEIER, U , AND SAMEH, A. The impact of hierarchical memory systems on linear algebra algorithm design. CSRD Tech. Rep. 625, University of Illinois, 1987.Google Scholar
- 7 GEORGE, A., AND LIU, J Computer Solution of Large Sparse Positwe Defimte Systems. Prentice-Hall, Englewood Cliffs, N.J., 1981. Google ScholarDigital Library
- 8 GEORGE, A., LIU, J., AND NG, E. User's guide for SPARSPAK: Waterloo sparse linear equations package. Res. Rep. CS-78-30, Dept. of Computer Science, Univ. of Waterloo, 1980.Google Scholar
- 9 LIU, J. A compact row storage scheme for Cholesky factors using ehminatlon trees. ACM Trans. Math. Softw. 12, 2 (June 1986), 127-148 Google ScholarDigital Library
- 10 LIu, J. Modification of the minimum degree algorithm by multiple elimination. ACM Trans. Math. Softw 11, 2 (June 1985), 141-153 Google ScholarDigital Library
- 11 LIU, J. A note on sparse factorization in a paging environment. SIAM J. Sci. Stat. Comput. 8, 6 (Nov. 1987), 1085-1088. Google ScholarDigital Library
- 12 SIMON, H. D., Vu, P, AND YANG, C. Performance of a supernodal general sparse solver on the CRAY Y-MP: 1.68 GFLOPS with autotasking. Tech. Rep. SCA-TR-117, Boeing Computer Services, 1989.Google Scholar
Index Terms
- Efficient sparse matrix factorization on high performance workstations—exploiting the memory hierarchy
Recommendations
Algorithm 887: CHOLMOD, Supernodal Sparse Cholesky Factorization and Update/Downdate
CHOLMOD is a set of routines for factorizing sparse symmetric positive definite matrices of the form A or AAT, updating/downdating a sparse Cholesky factorization, solving linear systems, updating/downdating the solution to the triangular system Lx = b, ...
Row Modifications of a Sparse Cholesky Factorization
Given a sparse, symmetric positive definite matrix C and an associated sparse Cholesky factorization LDL$\tr$, we develop sparse techniques for updating the factorization after a symmetric modification of a row and column of C. We show how the ...
Highly Scalable Parallel Algorithms for Sparse Matrix Factorization
In this paper, we describe scalable parallel algorithms for symmetric sparse matrix factorization, analyze their performance and scalability, and present experimental results for up to 1,024 processors on a Cray T3D parallel computer. Through our ...
Comments