A review of frontal methods for solving linear systems
From MaRDI portal
Publication:1294625
DOI10.1016/0010-4655(96)00020-3zbMath0926.65030OpenAlexW1990675068MaRDI QIDQ1294625
Publication date: 30 November 1999
Published in: Computer Physics Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0010-4655(96)00020-3
Computational methods for sparse matrices (65F50) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (3)
Solving sparse linear least-squares problems on some supercomputers by using large dense blocks ⋮ An asynchronous direct solver for banded linear systems ⋮ A survey of direct methods for sparse linear systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multifrontal parallel distributed symmetric and unsymmetric solvers
- An Unsymmetric-Pattern Multifrontal Method for Sparse LU Factorization
- Design Features of a Frontal Code for Solving Sparse Unsymmetric Linear Systems Out-of-Core
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- On the storage requirement in the out-of-core multifrontal method for sparse factorization
- Exploiting Structural Symmetry in Unsymmetric Sparse Symbolic Factorization
- The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
- The design of a new frontal code for solving sparse, unsymmetric systems
- The design of MA48
- Exploiting zeros on the diagonal in the direct solution of indefinite sparse symmetric linear systems
- A set of level 3 basic linear algebra subprograms
- A combined unifrontal/multifrontal method for unsymmetric sparse matrices
- The use of profile reduction algorithms with a frontal code
- A frontal solution program for finite element analysis
This page was built for publication: A review of frontal methods for solving linear systems
