A Sherman-Morrison approach to the solution of linear systems

Authors:
N. Egidi;P. Maponi
Affiliations:
Dipartimento di Matematica e Informatica, Universití di Camerino, Camerino (MC) 62032, Italy;Dipartimento di Matematica e Informatica, Universití di Camerino, Camerino (MC) 62032, Italy
Venue:
Journal of Computational and Applied Mathematics
Year:
2006

Citing 11
Cited 3

Updating the inverse of a matrix

SIAM Review
Preconditioners for indefinite systems arising in optimization

SIAM Journal on Matrix Analysis and Applications
Preconditioned, adaptive, multipole-accelerated iterative methods for three-dimensional first-kind integral equations of potential theory

SIAM Journal on Scientific Computing
The Reverse Bordering Method

SIAM Journal on Matrix Analysis and Applications
Superlinear PCG methods for symmetric Toeplitz systems

Mathematics of Computation
Generalized solution of linear systems and image restoration

Journal of Optimization Theory and Applications
Rational Matrix Functions and Rank-1 Updates

SIAM Journal on Matrix Analysis and Applications
A Preconditioner for the Electric Field Integral Equation Based on Calderon Formulas

SIAM Journal on Numerical Analysis
A Fast Newton Algorithm for Entropy Maximization in Phase Determination

SIAM Review
A note on the recursive decoupling method for solving tridiagonal linear systems

Applied Mathematics and Computation
Preconditioning Sparse Nonsymmetric Linear Systems with the Sherman--Morrison Formula

SIAM Journal on Scientific Computing

The efficient solution of electromagnetic scattering for inhomogeneous media

Journal of Computational and Applied Mathematics
Parallel preconditioners for large scale partial difference equation systems

Journal of Computational and Applied Mathematics
The use of Sherman-Morrison formula in the solution of Fredholm integral equation of second kind

Mathematics and Computers in Simulation

Quantified Score

Hi-index	7.29

Visualization

Abstract

We propose a new direct method to solve linear systems. This method is based on the Sherman-Morrison formula and uses a finite iterative formula. To compare our method with the Restarted Generalized Minimum Residual Method and the Gaussian Elimination Method with Partial Pivoting, we use two classes of test problems: linear systems having Pascal, Cauchy, and Vandermonde matrices as coefficient matrices, and randomly generated linear systems.