Ordering techniques for singly bordered block diagonal forms for unsymmetric parallel sparse direct solvers (Q3600008): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: METIS / 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: HSL / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2099792367 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A column approximate minimum degree ordering algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coverings of Bipartite Graphs / rank
 
Normal rank

Latest revision as of 01:51, 29 June 2024

scientific article
Language Label Description Also known as
English
Ordering techniques for singly bordered block diagonal forms for unsymmetric parallel sparse direct solvers
scientific article

    Statements

    Ordering techniques for singly bordered block diagonal forms for unsymmetric parallel sparse direct solvers (English)
    0 references
    0 references
    0 references
    0 references
    9 February 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    large sparse linear systems
    0 references
    unsymmetric matrices
    0 references
    ordering
    0 references
    parallel processing
    0 references
    direct method
    0 references
    numerical examples
    0 references
    comparison of methods
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references