Modification of the minimum-degree algorithm by multiple elimination
From MaRDI portal
Publication:3685073
DOI10.1145/214392.214398zbMath0568.65015OpenAlexW2086648616MaRDI QIDQ3685073
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/
minimum degree algorithmordering problemexternal degreefill reducing propertymultiple eliminationsparse symmetric positive definite linear systems
Computational methods for sparse matrices (65F50) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (39)
Asymptotic properties of multivariate tapering for estimation and prediction ⋮ Householder reflections versus Givens rotations in sparse orthogonal decomposition ⋮ Recovering an optimal LP basis from an interior point solution ⋮ Solution of sparse positive definite systems on a shared-memory multiprocessor ⋮ Decomposition in multidimensional Boolean-optimization problems with sparse matrices ⋮ Matrix enlarging methods and their application ⋮ A parallel solver for the \(hp\)-version of finite element methods ⋮ Solution of sparse positive definite systems on a hypercube ⋮ On the row merge tree for sparse LU factorization with partial pivoting ⋮ A polynomial arc-search interior-point algorithm for linear programming ⋮ Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time ⋮ FaSa: A fast and stable quadratic placement algorithm ⋮ Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives ⋮ Task scheduling for parallel sparse Cholesky factorization ⋮ Experiments with sparse Cholesky using a sequential task-flow implementation ⋮ Effective preconditioning through minimum degree ordering interleaved with incomplete factorization ⋮ The Effect of Various Sparsity Structures on Parallelism and Algorithms to Reveal Those Structures ⋮ New parallel sparse direct solvers for multicore architectures ⋮ Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming ⋮ On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method ⋮ A survey of direct methods for sparse linear systems ⋮ Unnamed Item ⋮ A Navier-Stokes solver for complex three-dimensional turbulent flows adopting non-linear modelling of the Reynolds stresses ⋮ A primal-dual interior-point algorithm for quadratic programming ⋮ Fill-ins number reducing direct solver designed for FIT-type matrix ⋮ Preconditioning methods for very ill-conditioned three-dimensional linear elasticity problems ⋮ A Frisch-Newton algorithm for sparse quantile regression ⋮ The effect of ordering on preconditioned GMRES algorithm, for solving the compressible Navier‐Stokes equations ⋮ Fast Implementation of the Traveling-Salesman-Problem Method for Reordering Columns within Supernodes ⋮ A sparse-sparse iteration for computing a sparse incomplete factorization of the inverse of an SPD matrix ⋮ An overlapping domain decomposition preconditioning method for monolithic solution of shear bands ⋮ A Sparse Symmetric Indefinite Direct Solver for GPU Architectures ⋮ A parallel multi-\(p\) method ⋮ Improving parallel ordering of sparse matrices using genetic algorithms ⋮ A parallel interior point algorithm for linear programming on a network of transputers ⋮ PCx: an interior-point code for linear programming ⋮ Computational experience with a primal-dual interior point method for linear programming ⋮ PMORSy: parallel sparse matrix ordering software for fill-in minimization ⋮ Preconditioning techniques for large linear systems: A survey
This page was built for publication: Modification of the minimum-degree algorithm by multiple elimination
