The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices (Q4702235): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(6 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Iain S. Duff / rank
Normal rank
 
Property / author
 
Property / author: Jacko Koster / 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 / author
 
Property / author: Iain S. Duff / rank
 
Normal rank
Property / author
 
Property / author: Jacko Koster / 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.1137/s0895479897317661 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2017431061 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:00, 30 July 2024

scientific article; zbMATH DE number 1368529
Language Label Description Also known as
English
The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
scientific article; zbMATH DE number 1368529

    Statements

    The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices (English)
    0 references
    24 November 1999
    0 references
    algorithms
    0 references
    sparse matrices
    0 references
    maximum transversal
    0 references
    direct methods
    0 references
    iterative methods
    0 references
    preconditioning
    0 references
    reorderings
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references