Approximate inverse computation using Frobenius inner product
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1406961 (Why is no real title available?)
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
- A Quasi-Minimal Residual Variant of the Bi-CGSTAB Algorithm for Nonsymmetric Systems
- A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
- A comparative study of sparse approximate inverse preconditioners
- A direct solver for the least‐squares problem arising from GMRES(k)
- Approximate inverse preconditionings for sparse linear systems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Fully vectorizable block preconditionings with approximate inverses for non-symmetric systems of equations
- Parallel Preconditioning with Sparse Approximate Inverses
- Sparse Approximate-Inverse Preconditioners Using Norm-Minimization Techniques
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
- Geometrical inverse preconditioning for symmetric positive definite matrices
- Orthogonal Projections of the Identity: Spectral Analysis and Applications to Approximate Inverse Preconditioning
- A matrix iteration for finding Drazin inverse with ninth-order convergence
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)
