AN APPROXIMATE MATRIX INVERSION PROCEDURE BY PARALLELIZATION OF THE SHERMAN–MORRISON FORMULA

DOI10.1017/S1446181109000364zbMath1190.65047MaRDI QIDQ3564625

K. Moriya, Lin-Jie Zhang, Takashi Nodera

Publication date: 26 May 2010

Published in: The ANZIAM Journal (Search for Journal in Brave)

zbMATH Keywords

performancenumerical examplesparallel computationSherman-Morrison formulaapproximate inverse preconditioner

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Preconditioners for iterative methods (65F08)

Related Items (1)

Computing the pseudoinverse of specific Toeplitz matrices using rank-one updates

Cites Work

• On the Convergence of Restarted Krylov Subspace Methods
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Parallel Preconditioning with Sparse Approximate Inverses
• Preconditioning Sparse Nonsymmetric Linear Systems with the Sherman--Morrison Formula

This page was built for publication: AN APPROXIMATE MATRIX INVERSION PROCEDURE BY PARALLELIZATION OF THE SHERMAN–MORRISON FORMULA