scientific article; zbMATH DE number 2098233
From MaRDI portal
Publication:4814497
DOI<527::AID-NLA211>3.0.CO;2-O 10.1002/1099-1506(200010/12)7:7/8<527::AID-NLA211>3.0.CO;2-OzbMath1051.65055MaRDI QIDQ4814497
Publication date: 7 September 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
numerical examplesSchur complementgreedy algorithmdiagonal dominancesparse approximate inverseNewton-type iteration schememulti-level preconditioning
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)
Related Items (11)
An efficient matrix iteration family for finding the generalized outer inverse ⋮ A new scheme of computing the approximate inverse preconditioner for the reduced linear systems ⋮ On finding robust approximate inverses for large sparse matrices ⋮ GIBS: a general and efficient iterative method for computing the approximate inverse and Moore–Penrose inverse of sparse matrices based on the Schultz iterative method with applications ⋮ A new iterative method for finding approximate inverses of complex matrices ⋮ An efficient matrix iterative method for computing Moore-Penrose inverse ⋮ An efficient matrix iteration for computing weighted Moore-Penrose inverse ⋮ Chebyshev-type methods and preconditioning techniques ⋮ An efficient class of iterative methods for computing generalized outer inverse \({M_{T,S}^{(2)}}\) ⋮ A fast convergent iterative solver for approximate inverse of matrices ⋮ Finding the Moore-Penrose inverse by a new matrix iteration
Uses Software
Cites Work
This page was built for publication:
