Detection of near-singularity in Cholesky and \(LDL^ T\) factorizations (Q1092611): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q114214729, #quickstatements; #temporary_batch_1711234560214
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Low‐rank revealing QR factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Estimate for the Condition Number of a Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3932291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank and null space calculations using matrix decomposition without column interchanges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5185900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric decomposition of a positive definite matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refined Error Analyses of Cholesky Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: New factorization codes for sparse, symmetric and positive definite matrices / rank
 
Normal rank

Latest revision as of 11:41, 18 June 2024

scientific article
Language Label Description Also known as
English
Detection of near-singularity in Cholesky and \(LDL^ T\) factorizations
scientific article

    Statements

    Detection of near-singularity in Cholesky and \(LDL^ T\) factorizations (English)
    0 references
    1987
    0 references
    Cholesky factorization
    0 references
    sparse matrix
    0 references
    nearly singular matrix
    0 references
    factorizations without pivoting
    0 references
    smallest eigenvalue
    0 references
    inverse iteration
    0 references

    Identifiers

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