Exploiting zeros on the diagonal in the direct solution of indefinite sparse symmetric linear systems
From MaRDI portal
Publication:4371094
DOI10.1145/229473.229480zbMath0884.65020OpenAlexW2094442759WikidataQ113310389 ScholiaQ113310389MaRDI QIDQ4371094
Publication date: 7 January 1998
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: http://purl.org/net/epubs/manifestation/5739/RAL-TR-95-040.pdf
Gaussian eliminationaugmented systemsFortran subroutines\(2\times 2\) pivotssparse indefinite symmetric linear systemszero diagonal entries
Computational methods for sparse matrices (65F50) Direct numerical methods for linear systems and matrix inversion (65F05) Packaged methods for numerical algorithms (65Y15) Software, source code, etc. for problems pertaining to linear algebra (15-04)
Related Items
Splitting-based block preconditioning methods for block two-by-two matrices of real square blocks, Fast corrected Uzawa methods for solving symmetric saddle point problems, Solution of sparse rectangular systems using LSQR and Craig, An efficient analyse phase for element problems, A practical solution for KKT systems, On generalized parameterized inexact Uzawa method for a block two-by-two linear system, New preconditioners for nonsymmetric saddle point systems with singular \((1,1)\) block, A survey of direct methods for sparse linear systems, The factorability of symmetric matrices and some implications for statistical linear models, Structured preconditioners for nonsingular matrices of block two-by-two structures, The spectral properties of the Hermitian and skew-Hermitian splitting preconditioner for generalized saddle point problems, Efficient Matching for Column Intersection Graphs, A review of frontal methods for solving linear systems
Uses Software
