On finding robust approximate inverses for large sparse matrices
From MaRDI portal
algorithmapproximate matrix inversionconvergenceerror estimategeneralized minimal residual (GMRES) methodlarge sparse complex matricesMoore-Penrose inversenumerical examplesparallel computationpreconditionerrectangular matrixSchulz iterations
Direct numerical methods for linear systems and matrix inversion (65F05) Preconditioners for iterative methods (65F08) Iterative numerical methods for linear systems (65F10) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05)
Recommendations
- scientific article; zbMATH DE number 1406961
- Approximate Inverse Preconditioners via Sparse-Sparse Iterations
- On a fast iterative method for approximate inverse of matrices
- A new iterative method for finding approximate inverses of complex 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
Cites work
- A dominance notion for singular matrices with applications to nonnegative generalized inverses
- A family of iterative methods for computing Moore-Penrose inverse of a matrix
- A family of iterative methods for computing the approximate inverse of a square matrix and inner inverse of a non-square matrix
- An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications
- An inversion formula for a matrix polynomial about a (unit) root
- Chebyshev-type methods and preconditioning techniques
- Fast wavelet transforms and numerical algorithms I
- Generalized Inverses of Linear Transformations
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 2098233 (Why is no real title available?)
- Mathematica in action. Problem solving through visualization and computation. With CD-ROM.
- On the Numerical Properties of an Iterative Method for Computing the Moore–Penrose Generalized Inverse
- Smoothing and regularization with modified sparse approximate inverses
- Stair Matrices and Their Generalizations with Applications to Iterative Methods I: A Generalization of the Successive Overrelaxation Method
- Successive matrix squaring algorithm for computing outer inverses
- The Mathematica GuideBook for Numerics
Cited in
(28)- Local inversion of matrices with sparse inverses
- Construction of a convergent scheme for finding matrix sign function
- An efficient computation of generalized inverse of a matrix
- Factorizations of hyperpower family of iterative methods via least squares approach
- A survey on the high convergence orders and computational convergence orders of sequences
- Hyperpower least squares progressive iterative approximation
- Exploiting higher computational efficiency index for computing outer generalized inverses
- An efficient hyperpower iterative method for computing weighted Moore-Penrose inverse
- An efficient matrix iteration family for finding the generalized outer inverse
- Fast and accurate pseudoinverse with sparse matrix reordering and incremental approach
- An efficient matrix iterative method for computing Moore-Penrose inverse
- A rapid and powerful iterative method for computing inverses of sparse tensors with applications
- A class of Kung-Traub-type iterative algorithms for matrix inversion
- Further efficient hyperpower iterative methods for the computation of generalized inverses \(A_{T,S}^{(2)}\)
- Finding the Moore-Penrose inverse by a new matrix iteration
- Constructing two-step iterative methods with and without memory
- Approximation of the determinant of large sparse symmetric positive definite matrices
- scientific article; zbMATH DE number 1138094 (Why is no real title available?)
- Finding generalized inverses by a fast and efficient numerical method
- On hyperpower family of iterations for computing outer inverses possessing high efficiencies
- scientific article; zbMATH DE number 1406961 (Why is no real title available?)
- A fast and efficient Newton-Shultz-type iterative method for computing inverse and Moore-Penrose inverse of tensors
- scientific article; zbMATH DE number 2206814 (Why is no real title available?)
- scientific article; zbMATH DE number 4186990 (Why is no real title available?)
- 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 to find the Moore-Penrose inverse
- Efficient iterative methods for computing generalized inverse of tensors based on t-product
- Computing outer inverses by scaled matrix iterations
This page was built for publication: On finding robust approximate inverses for large sparse matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2929473)
