Predicting Structure in Sparse Matrix Computations

Authors:
John R. Gilbert
Affiliations:
-
Venue:
SIAM Journal on Matrix Analysis and Applications
Year:
1994

Citing 0
Cited 8

Preconditioning techniques for large linear systems: a survey

Journal of Computational Physics
Nested-Dissection Orderings for Sparse LU with Partial Pivoting

NAA '00 Revised Papers from the Second International Conference on Numerical Analysis and Its Applications
SuperLU_DIST: A scalable distributed-memory sparse direct solver for unsymmetric linear systems

ACM Transactions on Mathematical Software (TOMS)
Diagonally-striped matrices and approximate inverse preconditioners

Journal of Computational and Applied Mathematics
Diagonally-striped matrices and approximate inverse preconditioners

Journal of Computational and Applied Mathematics
Faster graph-theoretic image processing via small-world and quadtree topologies

CVPR'04 Proceedings of the 2004 IEEE computer society conference on Computer vision and pattern recognition
SelInv---An Algorithm for Selected Inversion of a Sparse Symmetric Matrix

ACM Transactions on Mathematical Software (TOMS)
On techniques to improve robustness and scalability of a parallel hybrid linear solver

VECPAR'10 Proceedings of the 9th international conference on High performance computing for computational science

Quantified Score

Hi-index	0.01

Visualization

Abstract

Many sparse matrix algorithms---for example, solving a sparse system of linear equations---begin by predicting the nonzero structure of the output of a matrix computation from the nonzero structure of its input. This paper is a catalog of ways to predict nonzero structure. It contains known results for some problems, including various matrix factorizations, and new results for other problems, including some eigenvector computations.