Rank revealing \(LU\) factorizations (Q1200555): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q991113
Created claim: Wikidata QID (P12): Q114215293, #quickstatements; #temporary_batch_1722346090129
 
(4 intermediate revisions by 4 users not shown)
Property / reviewed by
 
Property / reviewed by: Marián Vajteršic / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A direct method for the solution of sparse linear least squares problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rang revealing QR factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Existence and Computation of LU-Factorizations with Small Pivots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Deflated Block-Elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: The evaluation of eigenvalues and eigenvectors of real symmetric matrices by simultaneous iteration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3928936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Probability of Large Diagonal Elements in the $QR$ Factorization / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0024-3795(92)90305-t / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2080329506 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q114215293 / rank
 
Normal rank

Latest revision as of 15:29, 30 July 2024

scientific article
Language Label Description Also known as
English
Rank revealing \(LU\) factorizations
scientific article

    Statements

    Rank revealing \(LU\) factorizations (English)
    0 references
    0 references
    0 references
    0 references
    16 January 1993
    0 references
    The paper deals with the \(LU\) factorization of square matrices. This problem is treated from the point of view of a generalization when permutations of the matrices are considered. The goal is to reveal the rank deficiency by the factorization. A two-pass rank revealing algorithm is developed. The approach is applied to a constraint optimization problem.
    0 references
    0 references
    0 references
    0 references
    0 references
    matrix permutation
    0 references
    \(LU\) factorization
    0 references
    rank deficiency
    0 references
    rank revealing algorithm
    0 references
    constraint optimization
    0 references
    0 references
    0 references