Massive memory buys little speed for complete, in-core sparse Cholesky factorizations on some scalar computers (Q803714): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q126352593, #quickstatements; #temporary_batch_1719271204161
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: An implementation of Karmarkar's algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: General Sparse Elimination Requires No Permanent Integer Storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3851516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3740904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3849175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3664299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Impact of Hardware Gather/Scatter on Sparse Gaussian Elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Sparse Factorization in a Paging Environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Karmarkar projections quickly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vector processing in simplex and interior methods for linear programming / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126352593 / rank
 
Normal rank

Latest revision as of 00:22, 25 June 2024

scientific article
Language Label Description Also known as
English
Massive memory buys little speed for complete, in-core sparse Cholesky factorizations on some scalar computers
scientific article

    Statements

    Massive memory buys little speed for complete, in-core sparse Cholesky factorizations on some scalar computers (English)
    0 references
    0 references
    1991
    0 references
    The author shows that the benefits of using large amounts of memory in direct factorizations of sparse, symmetric, positive-definite matrices more modest than pointed out by \textit{W. Murray} [Methods for linear programming, talk presented at the NATO Advanced Workshop on Algorithms and Model Formulations in Mathematical Programming, Bergen, Norway, 15-19 June 1987]. He gives the results of computational experiments performed on a variety of problems using IBM 3081 K, VAX 8550 and Sun-3/160. Relevant details about sparse Cholesky and data structures are described.
    0 references
    incore sparse Cholesky factorizations
    0 references
    direct factorizations
    0 references
    sparse, symmetric, positive-definite matrices
    0 references
    computational experiments
    0 references

    Identifiers