Improving approximate inverses based on Frobenius norm minimization
From MaRDI portal
Publication:2453338
DOI10.1016/j.amc.2013.03.057zbMath1288.15004OpenAlexW2093558392MaRDI QIDQ2453338
Publication date: 6 June 2014
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10553/16396
Theory of matrix inversion and generalized inverses (15A09) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast approximate solution of large scale sparse linear systems
- A generalization of the Moore-Penrose inverse related to matrix subspaces of \(\mathbb C^{n\times m}\)
- Preconditioners generated by minimizing norms
- An efficient parallel implementation of the MSPAI preconditioner
- Approximate sparsity patterns for the inverse of a matrix and preconditioning
- A comparative study of sparse approximate inverse preconditioners
- Preconditioning techniques for large linear systems: A survey
- Matrix Analysis
- Iterative Solution Methods
- Parallel Preconditioning with Sparse Approximate Inverses
- Sparse Approximate-Inverse Preconditioners Using Norm-Minimization Techniques
- Approximate Inverse Preconditioners via Sparse-Sparse Iterations
- Frobenius norm minimization and probing for preconditioning
- Approximate inverse computation using Frobenius inner product
- Orthogonal Projections of the Identity: Spectral Analysis and Applications to Approximate Inverse Preconditioning