Approximate inverse computation using Frobenius inner product
DOI10.1002/NLA.269zbMATH Open1071.65534OpenAlexW2131331606MaRDI QIDQ5317843FDOQ5317843
Authors:
Publication date: 21 September 2005
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nla.269
Recommendations
Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)
Cites Work
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- A Quasi-Minimal Residual Variant of the Bi-CGSTAB Algorithm for Nonsymmetric Systems
- Parallel Preconditioning with Sparse Approximate Inverses
- A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
- Approximate inverse preconditionings for sparse linear systems
- A comparative study of sparse approximate inverse preconditioners
- Sparse Approximate-Inverse Preconditioners Using Norm-Minimization Techniques
- Title not available (Why is that?)
- Fully vectorizable block preconditionings with approximate inverses for non-symmetric systems of equations
- A direct solver for the least‐squares problem arising from GMRES(k)
Cited In (10)
- Frobenius norm minimization and probing for preconditioning
- A generalization of the optimal diagonal approximate inverse preconditioner
- Improving approximate inverses based on Frobenius norm minimization
- Geometrical and spectral properties of the orthogonal projections of the identity
- Geometrical inverse matrix approximation for least-squares problems and acceleration strategies
- A generalization of the Moore-Penrose inverse related to matrix subspaces of \(\mathbb C^{n\times m}\)
- Computing preconditioners via subspace projection
- Orthogonal Projections of the Identity: Spectral Analysis and Applications to Approximate Inverse Preconditioning
- Geometrical inverse preconditioning for symmetric positive definite matrices
- A matrix iteration for finding Drazin inverse with ninth-order convergence
Uses Software
This page was built for publication: Approximate inverse computation using Frobenius inner product
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317843)