Frobenius norm minimization and probing for preconditioning
DOI10.1080/00207160701396387zbMath1126.65035OpenAlexW2040786813MaRDI QIDQ5308821
A. Kallischko, Thomas Kilian Huckle
Publication date: 8 October 2007
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160701396387
convergencenumerical examplespreconditioningiterative methodsparse linear systemsleast squares minimizationSchur complementsprobingsparse approximate inversesFrobenius norm minimizationmodified incomplete factorization
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Conditioning of matrices (15A12)
Related Items (8)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Block preconditioning and domain decomposition methods. II
- Factorized sparse approximate inverses for preconditioning
- The Interface Probing Technique in Domain Decomposition
- Approximate inverse preconditionings for sparse linear systems
- Factorized Sparse Approximate Inverse Preconditionings I. Theory
- A class of first order factorization methods
- Parallel Preconditioning with Sparse Approximate Inverses
- A Priori Sparsity Patterns for Parallel Sparse Approximate Inverse Preconditioners
- Sparse Approximate Inverses and Target Matrices
- New convergence results and preconditioning strategies for the conjugate gradient method
- A generalized SSOR method
This page was built for publication: Frobenius norm minimization and probing for preconditioning