On Finding Supernodes for Sparse Matrix Computations

DOI10.1137/0614019MaRDI QIDQ4033829zbMATH OpenOpenAlexFDO

Authors Joseph W. H. Liu, Barry W. Peyton, Esmond G. Ng

Publication date 16 May 1993

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

Full work available at URL https://www.osti.gov/biblio/6756314

zbMATH Keywords

algorithmCholesky factorizationelimination treeexperimental resultsfundamental supernodessparse Cholesky factorssparse matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50)

Recommendations

• A Supernodal Approach to Sparse Partial Pivoting
• An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination
• The use of supernodes in factored sparse approximate inverse preconditioning
• scientific article; zbMATH DE number 2087095
• Sparse matrix computations on the hypercube and related networks
• Solving sparse linear least-squares problems on some supercomputers by using large dense blocks
• scientific article; zbMATH DE number 4117735
• A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors
• Superlinear bounds for matrix searching problems

Cited in

(23)

• Hypermatrix oriented supernode amalgamation
• Refining an approximate inverse
• Parallel interior-point method for linear and quadratic programs with special structure
• Preconditioning techniques for large linear systems: A survey
• Some iterative methods for the solution of a symmetric indefinite KKT system
• An inexact Newton method combined with Hestenes multipliers' scheme for the solution of Karush-Kuhn-Tucker systems
• Inner solvers for interior point methods for large scale nonlinear programming
• Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking
• On the implementation and usage of SDPT3 -- a Matlab software package for semidefinite-quadratic-linear programming, version 4.0
• Exploiting hardware capabilities in interior point methods
• Enhancing performance and robustness of ILU preconditioners by blocking and selective transposition
• Fast implementation of the traveling-salesman-problem method for reordering columns within supernodes
• Solving large-scale linear programs by interior-point methods under the Matlab^∗Environment^†
• A Supernodal Approach to Sparse Partial Pivoting
• An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination
• A parallel sparse direct solver via hierarchical DAG scheduling
• Logarithmic barriers for sparse matrix cones
• Reordering strategy for blocking optimization in sparse linear solvers
• A survey of direct methods for sparse linear systems
• Stabilized and block approximate inverse preconditioners for problems in solid and structural mechanics
• Linear optimization over homogeneous matrix cones
• Algorithm 1042: sparse precision matrix estimation with \texttt{SQUIC}
• Compression, inversion, and approximate PCA of dense kernel matrices at near-linear computational complexity

This page was built for publication: On Finding Supernodes for Sparse Matrix Computations

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