Paper Info
Title
On the storage requirement in the out-of-core multifrontal method for sparse factorization
Abstract
Two techniques are introduced to reduce the working storage requirement for the recent multifrontal method of Duff and Reid used in the sparse out-of-core factorization of symmetric matrices. For a given core size, the reduction in working storage allows some large problems to be solved without having to use auxiliary storage for the working arrays. Even if the working arrays exceed the core size, it will reduce the amount of input-output traffic necessary to manipulate the working vectors. Experimental results are provided to demonstrate significant storage reduction on practical problems using the proposed techniques.
Year
DOI
Venue
1986
10.1145/7921.11325
ACM Trans. Math. Softw.
Keywords
Field
DocType
multifrontal method,tree pebble game,sparse matrix,general terms: algorithms additional key words and phrases: cholesky factorization,core size,significant storage reduction,out-of-core,practical problem,sparse factorization,input-output traffic,auxiliary storage,out-of-core multifrontal method,working vector,working array,working storage requirement,large problem,cholesky factorization,input output,symmetric matrices
Mathematical optimization,Computer science,Incomplete Cholesky factorization,Parallel computing,Symmetric matrix,Theoretical computer science,Out-of-core algorithm,Factorization,Auxiliary memory
Journal
Volume
Issue
ISSN
12
3
0098-3500
Citations 
PageRank 
References 
39
8.12
2
Authors
1
Name
Order
Citations
PageRank
Joseph W. H. Liu1829217.74