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