The open archive for STFC research publications

Full Record Details

Persistent URL http://purl.org/net/epubs/work/33024
Record Status Checked
Record Id 33024
Title An unsymmetric-pattern multifrontal method for sparse LU factorization
Abstract Sparse matrix factorization algorithms for general problems are typically characterized by irregular memory access patterns that limit their performance on parallel-vector supercomputers. For symmetric problems, methods such as the multifrontal method avoid indirect addressing in the innermost loops by using dense matrix kernels. However, no efficient LU factorization algorithm based primarily on dense matrix kernels exists for matrices whose pattern is very unsymmetric. We address this deficiency and present a new unsymmetric-pattern multifrontal method based on dense matrix kernels. As in the classical multifrontal method, advantage is taken of repetitive structure in the matrix by factorizing more than one pivot in each frontal matrix, thus enabling the use of Level 2 and Level 3 BLAS. The performance is compared with the classical multifrontal method and other unsymmetric solvers on a CRAY C-98.
Organisation CSE , CSE-NAG , SERC
Funding Information
Related Research Object(s):
Licence Information:
Language English (EN)
Type Details URI(s) Local file(s) Year
Journal Article SIAM J Matrix Anal A 18, no. 1 (1997): 140-158. doi:10.1137/S0895479894246905 1997
Report TR-94-038. 1994
Report RAL Technical Reports RAL-93-036. 1993. ddRAL93036.pdf 1993
Report TR-91-023. 1991