Modification of the minimum-degree algorithm by multiple elimination

DOI10.1145/214392.214398MaRDI QIDQ3685073zbMATH OpenOpenAlexFDO

Authors Joseph W. H. Liu

Publication date 1985

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL http://www.acm.org/pubs/contents/journals/toms/1985-11/

zbMATH Keywords

external degreefill reducing propertyminimum degree algorithmmultiple eliminationordering problemsparse symmetric positive definite linear systems

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50)

Recommendations

• The Evolution of the Minimum Degree Ordering Algorithm
• The Minimum Degree Ordering with Constraints
• An Approximate Minimum Degree Ordering Algorithm
• Minimal orderings revisited
• Node Selection Strategies for Bottom-Up Sparse Matrix Ordering

Cited in

(51)

• A sparse-sparse iteration for computing a sparse incomplete factorization of the inverse of an SPD matrix
• Householder reflections versus Givens rotations in sparse orthogonal decomposition
• Solution of sparse positive definite systems on a shared-memory multiprocessor
• Solution of sparse positive definite systems on a hypercube
• A parallel interior point algorithm for linear programming on a network of transputers
• Recovering an optimal LP basis from an interior point solution
• Matrix enlarging methods and their application
• A parallel solver for the hp-version of finite element methods
• FaSa: A fast and stable quadratic placement algorithm
• A parallel multi-p method
• Decomposition in multidimensional Boolean-optimization problems with sparse matrices
• Experiments with sparse Cholesky using a sequential task-flow implementation
• New parallel sparse direct solvers for multicore architectures
• Preconditioning techniques for large linear systems: A survey
• Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives
• Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming
• An overlapping domain decomposition preconditioning method for monolithic solution of shear bands
• A primal-dual interior-point algorithm for quadratic programming
• A Frisch-Newton algorithm for sparse quantile regression
• Improving parallel ordering of sparse matrices using genetic algorithms
• The multiple minimum degree ordering with greedy graph compression for vector computers
• A sparse symmetric indefinite direct solver for GPU architectures
• Asymptotic properties of multivariate tapering for estimation and prediction
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• The Effect of Various Sparsity Structures on Parallelism and Algorithms to Reveal Those Structures
• scientific article; zbMATH DE number 3844934 (Why is no real title available?)
• Fast implementation of the traveling-salesman-problem method for reordering columns within supernodes
• On the Performance of the Minimum Degree Ordering for Gaussian Elimination
• A Structurally Stable Modification of Hellerman–Rarick’s ${\text{P}}^4 $ Algorithm for Reordering Unsymmetric Sparse Matrices
• The Evolution of the Minimum Degree Ordering Algorithm
• scientific article; zbMATH DE number 151797 (Why is no real title available?)
• A Navier-Stokes solver for complex three-dimensional turbulent flows adopting non-linear modelling of the Reynolds stresses
• Preconditioning methods for very ill-conditioned three-dimensional linear elasticity problems
• scientific article; zbMATH DE number 724214 (Why is no real title available?)
• scientific article; zbMATH DE number 1106568 (Why is no real title available?)
• Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time
• scientific article; zbMATH DE number 1981892 (Why is no real title available?)
• PCx: an interior-point code for linear programming
• The effect of ordering on preconditioned GMRES algorithm, for solving the compressible Navier‐Stokes equations
• An Approximate Minimum Degree Ordering Algorithm
• The Minimum Degree Ordering with Constraints
• scientific article; zbMATH DE number 2098239 (Why is no real title available?)
• Effective preconditioning through minimum degree ordering interleaved with incomplete factorization
• Compressed Graphs and the Minimum Degree Algorithm
• PMORSy: parallel sparse matrix ordering software for fill-in minimization
• scientific article; zbMATH DE number 2201195 (Why is no real title available?)
• A survey of direct methods for sparse linear systems
• Computational experience with a primal-dual interior point method for linear programming
• On the row merge tree for sparse LU factorization with partial pivoting
• Task scheduling for parallel sparse Cholesky factorization
• Fill-ins number reducing direct solver designed for FIT-type matrix

This page was built for publication: Modification of the minimum-degree algorithm by multiple elimination

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