Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,216,624 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
12 relations
Algorithm
Cholesky decomposition
Finite element method
Gaussian elimination
Expand
Broader (1)
Numerical linear algebra
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
An Implementation of the Minimum-Degree Algorithm Using Simple Data Structures
R. Vanderbei
2016
Corpus ID: 115151925
The most popular ordering algorithm for reducing the number of arithmetic operations in the Cholesky factorization of a symmetric…
Expand
2016
2016
A global , distributed ordering library
C. Ashcraft
,
François-Henry Rouet
2016
Corpus ID: 43547094
Computing a fill-reducing ordering of a sparse matrix is a critical step for sparse direct solvers. In the early days of the…
Expand
2011
2011
Improved Minimum Degree Algorithm of Optimal Ordering
Xiao-Feng Jia
2011
Corpus ID: 124092170
The improved minimum degree algorithm(MD) has been used in the paper to enhance the effectiveness and efficiency of the optimal…
Expand
2008
2008
The Minimum Degree Heuristic and the Minimal Triangulation Process
A. Berry
,
P. Heggernes
,
eve Simonet
2008
Corpus ID: 267881498
The Minimum Degree Algorithm, one of the classical algorithms of sparse matrix computations, is a heuristic for computing a…
Expand
2001
2001
Algoritma derajat minimum degree algorithm melalui pendekatan reachable set dan implentasinya
Wiwin Winanto
2001
Corpus ID: 116363430
Pada penyelesaian sisteni persamaan linier Ax = b, dengan A matriks n x n, sparse simet•i dan defini/ melalui metode Cholesky…
Expand
1998
1998
Parallelizing and de-parallelizing elimination orders
C. Bornstein
1998
Corpus ID: 18627316
Abstract : The order in which the variables of a linear system are processed determines the total amounts of fill and work to…
Expand
1994
1994
A Study of the Factorization Fill-In for a ParallelImplementation of the Finite Element
MethodValerie
,
E.
,
TaylorNorthwestern
,
UniversityDept
1994
Corpus ID: 14983988
In this paper we investigate the additional storage overhead needed for a parallel implementation of nite element applications…
Expand