Name
Abstract | ||
|---|---|---|
In this paper, we show that the multifrontal method can have significant advantage over the conventional sparse column-Cholesky scheme on a paged virtual memory system. A more than tenfold reduction in paging activities can be achieved, which saves as much as 20 percent in factorization time. We also introduce a hybrid sparse factorization method, which uses a mixture of column-Cholesky and submatrix-Cholesky operations. By switching to the use of frontal matrices from column-Cholesky operations at appropriate columns, we demonstrate that the proposed hybrid scheme has an advantage over the sparse column-Cholesky method in reducing paging activities and over the multifrontal method in its adaptability to the amount of available working storage. |
Year | DOI | Venue |
|---|---|---|
1989 | 10.1145/76909.76911 | ACM Trans. Math. Softw. |
Keywords | Field | DocType |
sparse column-cholesky method,significant advantage,multifrontal method,proposed hybrid scheme,appropriate column,conventional sparse column-cholesky scheme,paging activity,sparse cholesky factorization,additional key words and phrases: cholesky factorization,sparse matrix,hybrid sparse factorization method,column-cholesky operation,elimination tree,paging,factorization time,virtual memory,cholesky factorization | Linear algebra,Computer science,Matrix (mathematics),Virtual memory,Parallel computing,Theoretical computer science,Factorization,Paging,Numerical analysis,Sparse matrix,Cholesky decomposition | Journal |
Volume | Issue | ISSN |
15 | 4 | 0098-3500 |
Citations | PageRank | References |
15 | 5.09 | 5 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Joseph W. H. Liu | 1 | 829 | 217.74 |