Structured Multifrontal Sparse Solver
StruMF is an algebraic structured preconditioner for the interative solution of large sparse linear systems. The preconditioner corresponds to a multifrontal variant of sparse LU factorization in which some dense blocks of the factors are approximated with low-rank matrices. It is algebraic in that it only requires the linear system itself, and the approximation threshold that determines the accuracy of individual low-rank approximations. Favourable rank properties are obtained using a block partitioning which is a refinement of the partitioning induced by nested dissection ordering.
- Short Name / Acronym:
- STRUMF
- Project Type:
- Open Source, No Publicly Available Repository
- Site Accession Number:
- 5185; 2014-104
- Software Type:
- Scientific
- License(s):
- Other
- Programming Language(s):
- C compilers
- Research Organization:
- Lawrence Berkeley National Laboratory (LBNL), Berkeley, CA (United States)
- Sponsoring Organization:
- USDOEPrimary Award/Contract Number:AC02-05CH11231
- DOE Contract Number:
- AC02-05CH11231
- Code ID:
- 57172
- OSTI ID:
- 1231790
- Country of Origin:
- United States
Similar Records
A fast, memory efficient and robust sparse preconditioner based on a multifrontal approach with applications to finite‐element matrices
High performance sparse multifrontal solvers on modern GPUs
An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling
Journal Article
·
Tue Feb 02 00:00:00 EST 2016
· International Journal for Numerical Methods in Engineering
·
OSTI ID:1231790
High performance sparse multifrontal solvers on modern GPUs
Journal Article
·
Sat Feb 05 00:00:00 EST 2022
· Parallel Computing
·
OSTI ID:1231790
An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling
Journal Article
·
Thu Oct 27 00:00:00 EDT 2016
· SIAM Journal on Scientific Computing
·
OSTI ID:1231790
+2 more