Reordering for parallelism (Q4392334): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1080/00207169808804670 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2037868567 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Data Structure for Parallel L/U Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Reordering Algorithm for Parallel Pivoting of Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Algorithm for Reordering Sparse Matrices for Parallel Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Algorithms for Sparse Linear Systems / rank
 
Normal rank

Latest revision as of 11:45, 28 May 2024

scientific article; zbMATH DE number 1160118
Language Label Description Also known as
English
Reordering for parallelism
scientific article; zbMATH DE number 1160118

    Statements

    Reordering for parallelism (English)
    0 references
    0 references
    0 references
    0 references
    15 November 1998
    0 references
    sparse matrix
    0 references
    Cholesky factorization
    0 references
    parallel ordering
    0 references
    Jess-Kees method
    0 references
    test problems
    0 references
    Boling-Harwell sparse matrix collection
    0 references

    Identifiers