A generalization of the optimal diagonal approximate inverse preconditioner
From MaRDI portal
Publication:2013784
DOI10.1016/J.CAMWA.2013.10.004zbMATH Open1368.65040OpenAlexW2018856285MaRDI QIDQ2013784FDOQ2013784
Authors: Yanyan Li 
Publication date: 9 August 2017
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2013.10.004
Recommendations
- Orthogonal Projections of the Identity: Spectral Analysis and Applications to Approximate Inverse Preconditioning
- Numerical experiments with two approximate inverse preconditioners
- Approximate inverse preconditionings for sparse linear systems
- A comparative study of sparse approximate inverse preconditioners
- Generalized approximate inverse preconditioners for least squares problems
Computational methods for sparse matrices (65F50) Preconditioners for iterative methods (65F08) Iterative numerical methods for linear systems (65F10)
Cites Work
- The university of Florida sparse matrix collection
- Preconditioning techniques for large linear systems: A survey
- Title not available (Why is that?)
- Title not available (Why is that?)
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Parallel iterative methods for sparse linear systems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Iterative Solution Methods
- Conjugate Gradient Methods for Toeplitz Systems
- Parallel Preconditioning with Sparse Approximate Inverses
- Approximate Inverse Preconditioners via Sparse-Sparse Iterations
- A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
- Title not available (Why is that?)
- Title not available (Why is that?)
- A comparative study of sparse approximate inverse preconditioners
- Optimal and Superoptimal Circulant Preconditioners
- A generalization of the Moore-Penrose inverse related to matrix subspaces of \(\mathbb C^{n\times m}\)
- Robust approximate inverse preconditioning for the conjugate gradient method
- Sparse Approximate-Inverse Preconditioners Using Norm-Minimization Techniques
- Approximate inverse computation using Frobenius inner product
- Orthogonal Projections of the Identity: Spectral Analysis and Applications to Approximate Inverse Preconditioning
- Parallel algorithms for the solution of certain large sparse linear systems
- Fast approximate solution of large scale sparse linear systems
- MSP: A Class of Parallel Multistep Successive Sparse Approximate Inverse Preconditioning Strategies
- Factored approximate inverse preconditioners with dynamic sparsity patterns
- A family of modified regularizing circulant preconditioners for two-levels Toeplitz systems
- Preconditioners generated by minimizing norms
- Some iterative methods related to Frobenius norm minimization
Cited In (4)
- Generalized approximate inverse preconditioners for least squares problems
- Title not available (Why is that?)
- A novel class of approximate inverse preconditioners for large positive definite linear systems in optimization
- Orthogonal Projections of the Identity: Spectral Analysis and Applications to Approximate Inverse Preconditioning
Uses Software
This page was built for publication: A generalization of the optimal diagonal approximate inverse preconditioner
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2013784)
