The solution of linear systems by using the Sherman-Morrison formula
Publication:860990
DOI10.1016/j.laa.2006.07.007zbMath1111.65027OpenAlexW2070948799MaRDI QIDQ860990
Publication date: 9 January 2007
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2006.07.007
convergencenumerical examplesGauss eliminationsparse matrixVandermonde matrixdirect methodspartial pivotingCauchy matrixPascal matrixapproximate inverse preconditioner
Computational methods for sparse matrices (65F50) Numerical computation of matrix norms, conditioning, scaling (65F35) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (7)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- NAG
- A Sherman-Morrison approach to the solution of linear systems
- A comparative study of sparse approximate inverse preconditioners
- A note on the recursive decoupling method for solving tridiagonal linear systems
- A numerical method for a direct obstacle scattering problem
- Matrix Inversion by the Annihilation of Rank
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- An extended set of FORTRAN basic linear algebra subprograms
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Preconditioning Sparse Nonsymmetric Linear Systems with the Sherman--Morrison Formula
- Adjustment of an Inverse Matrix Corresponding to a Change in One Element of a Given Matrix
This page was built for publication: The solution of linear systems by using the Sherman-Morrison formula