On Exploiting Sparsity of Multiple Right-Hand Sides in Sparse Direct Solvers

DOI10.1137/17M1151882zbMath1406.65030MaRDI QIDQ4613506

Gilles Moreau, Patrick R. Amestoy, Jean-Yves L'Excellent

Publication date: 1 February 2019

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/17m1151882

zbMATH Keywords

sparse matrices; direct method; sparse linear algebra; multiple sparse right-hand sides

Mathematics Subject Classification ID

65F50: Computational methods for sparse matrices

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

65F05: Direct numerical methods for linear systems and matrix inversion

15A06: Linear equations (linear algebraic aspects)

Related Items

Efficient use of sparsity by direct solvers applied to 3D controlled-source EM problems, Structured condition number for multiple right-hand side linear systems with parameterized quasiseparable coefficient matrix

Cites Work

• Unnamed Item
• Direct Methods for Sparse Matrices
• On Computing Inverse Entries of a Sparse Matrix in an Out-of-Core Environment
• The Role of Elimination Trees in Sparse Factorization
• Predicting Structure in Sparse Matrix Computations
• A set of level 3 basic linear algebra subprograms
• Parallel Computation of Entries of ${A}^{-1}$
• Elimination Structures for Unsymmetric Sparse $LU$ Factors
• Reducing the Total Bandwidth of a Sparse Unsymmetric Matrix
• The Theory of Elimination Trees for Sparse Unsymmetric Matrices
• AMPS: An Augmented Matrix Formulation for Principal Submatrix Updates with Application to Power Grids
• Nested Dissection of a Regular Finite Element Mesh