Preconditioning Sparse Nonsymmetric Linear Systems with the Sherman--Morrison Formula

DOI10.1137/S1064827502407524zbMath1048.65042OpenAlexW2166705945MaRDI QIDQ4442492

No author found.

Publication date: 20 January 2004

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

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

zbMATH Keywords

numerical examplesSherman-Morrison formulanonsymmetric linear systemsincomplete factorizationpreconditioned iterative methodsfactorized sparse approximate inverses

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items (13)

A Sherman-Morrison approach to the solution of linear systems ⋮ Preconditioning Toeplitz-plus-diagonal linear systems using the Sherman-Morrison-Woodbury formula ⋮ The solution of linear systems by using the Sherman-Morrison formula ⋮ Balanced incomplete factorization preconditioner with pivoting ⋮ Greville's method for preconditioning least squares problems ⋮ On an augmented Lagrangian-based preconditioning of Oseen type problems ⋮ Supporting theory for a block approximate inverse preconditioner ⋮ Low-rank updates of balanced incomplete factorization preconditioners ⋮ AN APPROXIMATE MATRIX INVERSION PROCEDURE BY PARALLELIZATION OF THE SHERMAN–MORRISON FORMULA ⋮ A class of preconditioners based on matrix splitting for nonsymmetric linear systems ⋮ Computing the pseudoinverse of specific Toeplitz matrices using rank-one updates ⋮ Preconditioner based on the Sherman-Morrison formula for regularized least squares problems ⋮ A numerical method for a direct obstacle scattering problem

Uses Software

• SparseMatrix
• Harwell-Boeing sparse matrix collection

This page was built for publication: Preconditioning Sparse Nonsymmetric Linear Systems with the Sherman--Morrison Formula