Predicting Structure in Sparse Matrix Computations

DOI10.1137/S0895479887139455zbMATH Open0796.65061OpenAlexW1988420772MaRDI QIDQ4287891FDOQ4287891

Authors: J. R. Gilbert 

Publication date: 19 April 1994

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895479887139455

Recommendations

• Structure prediction and computation of sparse matrix products
• scientific article; zbMATH DE number 554767
• On optimizing multiplications of sparse matrices
• Automatic Nonzero Structure Analysis

zbMATH Keywords

eigenvectorstructure predictionnonzero structuresparse matrix computations

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50)

Cited In (26)

• Identifying small mean-reverting portfolios
• Preconditioning techniques for large linear systems: A survey
• A survey of direct methods for sparse linear systems
• Diagonally-striped matrices and approximate inverse preconditioners
• Refining an approximate inverse
• On exploiting sparsity of multiple right-hand sides in sparse direct solvers
• Efficient use of sparsity by direct solvers applied to 3D controlled-source EM problems
• Title not available (Why is that?)
• Exact solution of sparse linear systems via left-looking roundoff-error-free Lu factorization in time proportional to arithmetic work
• A transformation approach that makes SPAI, PSAI and RSAI procedures efficient for large double irregular nonsymmetric sparse linear systems
• A residual based sparse approximate inverse preconditioning procedure for large sparse linear systems.
• Title not available (Why is that?)
• On techniques to improve robustness and scalability of a parallel hybrid linear solver
• AMPS: an augmented matrix formulation for principal submatrix updates with application to power grids
• Predicting the structure of sparse orthogonal factors
• State-of-the-art sparse direct solvers
• On the Chordality of Simple Decomposition in Top-Down Style
• Sparse direct methods for model simulation
• Preconditioning of linear least squares by robust incomplete factorization for implicitly held normal equations
• A power sparse approximate inverse preconditioning procedure for large sparse linear systems
• The structure of the eigenvectors of sparse matrices
• Chordal graphs in triangular decomposition in top-down style
• Patterns that preserve sparsity in orthogonal factorization
• Separators and structure prediction in sparse orthogonal factorization
• Title not available (Why is that?)
• Combinatorial Aspects in Sparse Elimination Methods

This page was built for publication: Predicting Structure in Sparse Matrix Computations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4287891)