The Evolution of the Minimum Degree Ordering Algorithm
From MaRDI portal
Publication:3823722
Recommendations
- An Approximate Minimum Degree Ordering Algorithm
- The Minimum Degree Ordering with Constraints
- A column approximate minimum degree ordering algorithm
- An order-based algorithm for minimum dominating set with application in graph mining
- Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph
- Minimal elimination ordering for graphs of bounded degree
- Modification of the minimum-degree algorithm by multiple elimination
- A wide-range algorithm for minimal triangulation from an arbitrary ordering
- A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees
- A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees
Cited in
(82)- Exploiting special structure in semidefinite programming: a survey of theory and applications
- The average parallel complexity of Cholesky factorization
- Using an interior point method for the master problem in a decomposition approach
- A parallel interior point algorithm for linear programming on a network of transputers
- Partitioning a chordal graph into transitive subgraphs for parallel sparse triangular solution
- Using domain decomposition to find graph bisectors
- Two improved algorithms for envelope and wavefront reduction
- A parallel solver for the hp-version of finite element methods
- Automated adaptive multilevel solver
- An algebraic multilevel parallelizable preconditioner for large-scale CFD problems
- A parallel multi-p method
- Automotive design applications of fluid flow simulation on parallel computing platforms
- Graphical models for genetic analyses
- A grid-based multilevel incomplete LU factorization preconditioning technique for general sparse matrices
- Preconditioning techniques for large linear systems: A survey
- Applying abstraction and formal specification in numerical software design
- Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives
- Some computational aspects of a group theoretic finite element approach to the buckling and postbuckling analyses of plates and shells of revolution
- Multiphysics simulation of flow-induced vibrations and aeroelasticity on parallel computing platforms
- Parallel direct solver for solving systems of linear equations resulting from finite element method on multi-core desktops and workstations
- Parallel finite element solver for multi-core computers with shared memory
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion
- Learning chordal extensions
- Cached Gaussian elimination for simulating Stokes flow on domains with repetitive geometry
- Exploiting structure in parallel implementation of interior point methods for optimization
- The effect of graph partitioning techniques on parallel block FSAI preconditioning: a computational study
- Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree
- Improving parallel ordering of sparse matrices using genetic algorithms
- On the static interaction of fluid and gas loaded multi-chamber systems in large deformation finite element analysis
- Parallelized integrated nested Laplace approximations for fast Bayesian inference
- The multiple minimum degree ordering with greedy graph compression for vector computers
- Minimal orderings revisited
- Exploiting hardware capabilities in interior point methods
- Differentiation of matrix functionals using triangular factorization
- A note on fast approximate minimum degree orderings for symmetric matrices with some dense rows
- State-of-the-art sparse direct solvers
- Fast implementation of the traveling-salesman-problem method for reordering columns within supernodes
- Graphical Models and Message-Passing Algorithms: Some Introductory Lectures
- On the Performance of the Minimum Degree Ordering for Gaussian Elimination
- Combinatorial Aspects in Sparse Elimination Methods
- Modification of the minimum-degree algorithm by multiple elimination
- Implementing cholesky factorization for interior point methods of linear programming
- On sparse matrix orderings in interior point methods
- Footbridge between finite volumes and finite elements with applications to CFD
- Efficient unsteady high Reynolds number flow computations on unstructured grids
- Node Selection Strategies for Bottom-Up Sparse Matrix Ordering
- Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time
- LOQO:an interior point code for quadratic programming
- Graph bisection with Pareto optimization
- JASMIN-based two-dimensional adaptive combined preconditioner for radiation diffusion equations in inertial fusion research
- Inference via low-dimensional couplings
- An Approximate Minimum Degree Ordering Algorithm
- The Minimum Degree Ordering with Constraints
- Effective preconditioning through minimum degree ordering interleaved with incomplete factorization
- Compressed Graphs and the Minimum Degree Algorithm
- Reordering and incomplete preconditioning in serial and parallel adaptive mesh refinement and coarsening flow solutions
- A survey on direct solvers for Galerkin methods
- scientific article; zbMATH DE number 1441125 (Why is no real title available?)
- Iterative methods for linear systems of equations: a brief historical journey
- On the minimum chordal completion polytope
- Matrix reordering using multilevel graph coarsening for ILU preconditioning
- Subspace Iteration Randomization and Singular Value Problems
- Customizable contraction hierarchies
- scientific article; zbMATH DE number 2201195 (Why is no real title available?)
- A parallel multilevel preconditioned iterative pressure Poisson solver for the large-eddy simulation of turbulent flow inside a duct
- Hierarchical Cholesky decomposition of sparse matrices arising from curl–curl-equation
- Algorithm 836
- Algorithm 837
- Fast minimal triangulation algorithm using minimum degree criterion
- Factoring matrices with a tree-structured sparsity pattern
- A survey of direct methods for sparse linear systems
- On the ordering of sparse linear systems
- PACE Solver Description: Tree Depth with FlowCutter
- scientific article; zbMATH DE number 7764126 (Why is no real title available?)
- The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth.
- Generating weakly chordal graphs from arbitrary graphs
- PARFES: A method for solving finite element linear equations on multi-core computers
- Recursive sparse LU decomposition based on nested dissection and low rank approximations
- On the impact of spatial covariance matrix ordering on tile low-rank estimation of Matérn parameters
- Parallel sparse Gaussian elimination with partial pivoting
- Task scheduling for parallel sparse Cholesky factorization
- Compression, inversion, and approximate PCA of dense kernel matrices at near-linear computational complexity
This page was built for publication: The Evolution of the Minimum Degree Ordering Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3823722)
