Skip to search formSkip to main contentSkip to account menu

Minimum degree algorithm

In numerical analysis the minimum degree algorithm is an algorithm used to permute the rows and columns of a symmetric sparse matrix before applying… 
Wikipedia (opens in a new tab)

Related topics

Related topics

12 relations
AlgorithmCholesky decompositionFinite element methodGaussian elimination

Broader (1)

Numerical linear algebra

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
A Fast Minimum Degree Algorithm and Matching Lower Bound
The minimum degree algorithm is one of the most widely-used heuristics for reducing the cost of solving large sparse systems of… 
2018
2018
Graph Sketching against Adaptive Adversaries Applied to the Minimum Degree Algorithm
Motivated by the study of matrix elimination orderings in combinatorial scientific computing, we utilize graph sketching and… 
2016
2016
A Simple, Fast and Near Optimal Approximation Algorithm for Optimization of Un-Weighted Minimum Vertex Cover
This paper presents a simple and efficient near optimal algorithm, named Maximum Adjacent Minimum degree Algorithm (MAMA) for… 
2012
2012
A Constrained Ordering for Solving the Equality Constrained State Estimation
This paper applies a simple constrained ordering for the solution of the equality constrained state estimation problem. By low… 
2010
2010
A note on fast approximate minimum degree orderings for symmetric matrices with some dense rows
Recently, a number of variants of the approximate minimum degree algorithm have been proposed that aim to efficiently order… 
2008
2008
An approximate minimum degree algorithm for matrices with dense rows
We present a modified version of the approximate minimum degree algorithm for preordering a matrix with a symmetric sparsity… 
2002
2002
Object Oriented Set Theoretic Implementation of Minimum Degree Algorithm
Sparse Symmetric Positive Definite (SPD)Lin- ear System Solvers (LSS) are routinely required in various Power System Analysis… 
Highly Cited
2001
Highly Cited
2001
The Computational Complexity of the Minimum Degree Algorithm
A new and distinct variety of rose plant of the floribunda class, having strong clustering ability; vigorous upright growth; long… 
2001
2001
Algoritma derajat minimum degree algorithm melalui pendekatan reachable set dan implentasinya
Pada penyelesaian sisteni persamaan linier Ax = b, dengan A matriks n x n, sparse simet•i dan defini/ melalui metode Cholesky… 
Highly Cited
1992
Highly Cited
1992
Towards a cost-effective ILU preconditioner with high level fill
There has been increased interest in the effect of the ordering of the unknowns on Preconditioned Conjugate Gradient (PCG… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)