A column approximate minimum degree ordering algorithm (Q5461205): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q113310742, #quickstatements; #temporary_batch_1706897434465
Set OpenAlex properties.
 
(8 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Esmond G. Ng / rank
Normal rank
 
Property / author
 
Property / author: Esmond G. Ng / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: AMD / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Matlab / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SparseMatrix / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Harwell-Boeing sparse matrix collection / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1145/1024074.1024079 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2167797964 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:16, 19 March 2024

scientific article; zbMATH DE number 2187989
Language Label Description Also known as
English
A column approximate minimum degree ordering algorithm
scientific article; zbMATH DE number 2187989

    Statements

    A column approximate minimum degree ordering algorithm (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 July 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    sparse Gaussian elimination
    0 references
    partial pivoting
    0 references
    column preordering
    0 references
    Cholesky factorization
    0 references
    minimum degree ordering algorithm
    0 references
    0 references
    0 references