New factorization codes for sparse, symmetric and positive definite matrices (Q4181188): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: MA28 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Design Features of a Sparse Matrix Code / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Elimination form of the Inverse and its Application to Linear Programming / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:15, 13 June 2024

scientific article; zbMATH DE number 3617444
Language Label Description Also known as
English
New factorization codes for sparse, symmetric and positive definite matrices
scientific article; zbMATH DE number 3617444

    Statements

    New factorization codes for sparse, symmetric and positive definite matrices (English)
    0 references
    0 references
    0 references
    1979
    0 references
    Storage Requirements
    0 references
    Factorization
    0 references
    Sparse Symmetric and Positive Definite Matrices
    0 references
    Computational Efficiency
    0 references
    Execution Time
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references