Sparse approximate inverse smoothers for geometric and algebraic multigrid
Applied Numerical Mathematics - Developments and trends in iterative methods for large systems of equations—in memoriam Rüdiger Weiss
A parallel solver for large-scale Markov chains
Applied Numerical Mathematics - Developments and trends in iterative methods for large systems of equations—in memoriam Rüdiger Weiss
Preconditioning techniques for large linear systems: a survey
Journal of Computational Physics
hypre: A Library of High Performance Preconditioners
ICCS '02 Proceedings of the International Conference on Computational Science-Part III
Domain decomposition preconditioning for parallel PDE software
Engineering computational technology
Global and localized parallel preconditioning techniques for large scale solid Earth simulations
Future Generation Computer Systems - Selected papers from CCGRID 2002
The effect of orderings on sparse approximate inverse preconditioners for non-symmetric problems
Advances in Engineering Software - Engineering computational technology
Journal of Computational Physics
Fast computational methods for locating fold points for the power flow equations
Journal of Computational and Applied Mathematics - Special Issue: Proceedings of the 10th international congress on computational and applied mathematics (ICCAM-2002)
Parallel Multilevel Sparse Approximate Inverse Preconditioners in Large Sparse Matrix Computations
Proceedings of the 2003 ACM/IEEE conference on Supercomputing
International Journal of High Performance Computing Applications
Pursuing scalability for hypre's conceptual interfaces
ACM Transactions on Mathematical Software (TOMS) - Special issue on the Advanced CompuTational Software (ACTS) Collection
Diagonally-striped matrices and approximate inverse preconditioners
Journal of Computational and Applied Mathematics
Conceptual interfaces in hypre
Future Generation Computer Systems
International Journal of Computer Mathematics - Fast Iterative and Preconditioning Methods for Linear and Non-Linear Systems
Frobenius norm minimization and probing for preconditioning
International Journal of Computer Mathematics - Fast Iterative and Preconditioning Methods for Linear and Non-Linear Systems
A class of multistep sparse matrix strategies for concept decomposition matrix approximation
Proceedings of the 2009 ACM symposium on Applied Computing
Conceptual interfaces in hypre
Future Generation Computer Systems
Diagonally-striped matrices and approximate inverse preconditioners
Journal of Computational and Applied Mathematics
Adaptive Techniques for Improving the Performance of Incomplete Factorization Preconditioning
SIAM Journal on Scientific Computing
A Block FSAI-ILU Parallel Preconditioner for Symmetric Positive Definite Linear Systems
SIAM Journal on Scientific Computing
Adaptive Pattern Research for Block FSAI Preconditioning
SIAM Journal on Scientific Computing
Banded target matrices and recursive FSAI for parallel preconditioning
Numerical Algorithms
A generalized Block FSAI preconditioner for nonsymmetric linear systems
Journal of Computational and Applied Mathematics
A hybrid multigrid method for convection-diffusion problems
Journal of Computational and Applied Mathematics
Parallel multigrid algorithms based on generic approximate sparse inverses: an SMP approach
The Journal of Supercomputing
Hi-index | 0.02 |
Parallel algorithms for computing sparse approximations to the inverse of a sparse matrix either use a prescribed sparsity pattern for the approximate inverse or attempt to generate a good pattern as part of the algorithm. This paper demonstrates that, for PDE problems, the patterns of powers of sparsified matrices (PSMs) can be used a priori as effective approximate inverse patterns, and that the additional effort of adaptive sparsity pattern calculations may not be required. PSM patterns are related to various other approximate inverse sparsity patterns through matrix graph theory and heuristics concerning the PDE's Green's function. A parallel implementation shows that PSM-patterned approximate inverses are significantly faster to construct than approximate inverses constructed adaptively, while often giving preconditioners of comparable quality.