The design of a new out-of-core multifrontal solver

Authors:
John K. Reid;Jennifer A. Scott
Affiliations:
Computational Science and Engineering Department, Rutherford Appleton Laboratory, Oxfordshire, England, UK;Computational Science and Engineering Department, Rutherford Appleton Laboratory, Oxfordshire, England, UK
Venue:
PARA'06 Proceedings of the 8th international conference on Applied parallel computing: state of the art in scientific computing
Year:
2006

Citing 3
Cited 0

The design and implementation of a new out-of-core sparse cholesky factorization method

ACM Transactions on Mathematical Software (TOMS)
MA57---a code for the solution of sparse symmetric definite and indefinite systems

ACM Transactions on Mathematical Software (TOMS)
A fully portable high performance minimal storage hybrid format Cholesky algorithm

ACM Transactions on Mathematical Software (TOMS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Direct methods for solving large sparse linear systems of equations are popular because of their generality and robustness. Their main weakness is that the memory they require increases rapidly with problem size. We discuss the design and development of a new multifrontal solver that aims to circumvent this problem by allowing both the system matrix and its factors to be stored externally. We highlight some of the key features of our new out-of-core package, in particular its use of efficient implementations of dense linear algebra kernels to perform partial factorizations and its memory management system. We present numerical results for some large-scale problems arising from practical applications.