Title: An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization
Abstract: This paper explores the use of a subblock decomposition strategy for parallel sparse Cholesky factorization in which the sparse matrix is decomposed into rectangular blocks. Such a strategy has enormous theoretical scalability advantages over more traditional column-oriented and panel-oriented decompositions. However, little progress has been made in producing a practical subblock method. This paper describes and evaluates an approach that is simple to implement, provides slightly higher performance than column (and panel) methods on small parallel machines, and has the potential to provide much higher performance on large parallel machines.
Publication Year: 1994
Publication Date: 1994-11-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 55
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot