Minimum deviation, quasi-LU factorization of nonsingular matrices (Q2383020): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Spanning-tree extensions of the Hadamard-Fischer inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692656 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some algebraic problems in connection with general eigenvalue algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of linear equations with skyline-stored symmetric matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5802185 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite dimensional Wiener-Hopf equations and factorizations of matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840770 / rank
 
Normal rank

Revision as of 09:32, 27 June 2024

scientific article
Language Label Description Also known as
English
Minimum deviation, quasi-LU factorization of nonsingular matrices
scientific article

    Statements

    Minimum deviation, quasi-LU factorization of nonsingular matrices (English)
    0 references
    0 references
    5 October 2007
    0 references
    The authors are concerned with the following problem. If the matrix \(A\) is nonsingular and has no \(LU\) factorization, how may \(A\) be factored into \(\widetilde L\) and \(\widetilde U\) that are ``nearly'' lower and upper triangular, respectively? They give an explicit measure of nearness to a matrix being triangular, and they introduce a measure, the deviation \(\text{dev}(\widetilde L,\widetilde U)\) of the quasi-\(LU\) factorization \(A=\widetilde L\widetilde U\) from an \(LU\) factorization. It is known that \(A\) can be written as \(LPU\), where \(L\) is unit lower triangular, \(P\) is a permutation matrix, and \(U\) is upper triangular. One obtains a quasi-\(LU\) factorization of \(A\) by putting \(\widetilde L=LP\) and \(\widetilde U=U\). The authors calculate \(\text{dev}(\widetilde L,\widetilde U)\) and establish that the deviation of any quasi-\(LU\) factorization cannot be better than the one mentioned above.
    0 references
    \(LU\) factorization
    0 references
    \(LPU\) factorization
    0 references
    sparsity pattern
    0 references
    deviation
    0 references

    Identifiers

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