A Direct Projection Method for Sparse Linear Systems

DOI10.1137/0916067zbMath0853.65035OpenAlexW2030349096MaRDI QIDQ4852598

Michele Benzi, Carl D. jun. Meyer

Publication date: 8 December 1996

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

Full work available at URL: https://semanticscholar.org/paper/1020b50b69ace1d9a32291ad48d9b5883e8248bc

zbMATH Keywords

Gaussian eliminationprojection algorithmlarge, sparse and unstructured systems of linear equationssparsity-preserving pivoting strategy

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block, Finding the orthogonal projection of a point onto an affine subspace, Iterative refinement using splitting methods, Extended rank reduction formulas containing Wedderburn and Abaffy-Broyden-Spedicato rank reducing processes, On Kaczmarz's projection iteration as a direct solver for linear least squares problems, The direct-projection methods, A direct projection method for Markov chains, Symmetric block-SOR methods for rank-deficient least squares problems, A robust ILU with pivoting based on monitoring the growth of the inverse factors, Unnamed Item, Block SOR methods for rank-deficient least-squares problems