On Finding Supernodes for Sparse Matrix Computations
From MaRDI portal
Publication:4033829
DOI10.1137/0614019zbMath0765.65034OpenAlexW2101501830MaRDI QIDQ4033829
Barry W. Peyton, Joseph W. H. Liu, 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
algorithmCholesky factorizationsparse matrixexperimental resultselimination treefundamental supernodessparse Cholesky factors
Computational methods for sparse matrices (65F50) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
Logarithmic barriers for sparse matrix cones, Inner solvers for interior point methods for large scale nonlinear programming, Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking, Reordering Strategy for Blocking Optimization in Sparse Linear Solvers, Linear optimization over homogeneous matrix cones, Enhancing Performance and Robustness of ILU Preconditioners by Blocking and Selective Transposition, Some iterative methods for the solution of a symmetric indefinite KKT system, Compression, inversion, and approximate PCA of dense kernel matrices at near-linear computational complexity, A survey of direct methods for sparse linear systems, Stabilized and block approximate inverse preconditioners for problems in solid and structural mechanics, On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0, Hypermatrix oriented supernode amalgamation, Fast Implementation of the Traveling-Salesman-Problem Method for Reordering Columns within Supernodes, Exploiting hardware capabilities in interior point methods, An inexact Newton method combined with Hestenes multipliers' scheme for the solution of Karush-Kuhn-Tucker systems, Refining an approximate inverse, Solving large-scale linear programs by interior-point methods under the Matlab∗Environment†, A Parallel Sparse Direct Solver via Hierarchical DAG Scheduling, Parallel interior-point method for linear and quadratic programs with special structure, Preconditioning techniques for large linear systems: A survey
