Minimum deviation, quasi-LU factorization of nonsingular matrices (Q2383020)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Minimum deviation, quasi-LU factorization of nonsingular matrices |
scientific article; zbMATH DE number 5197754
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum deviation, quasi-LU factorization of nonsingular matrices |
scientific article; zbMATH DE number 5197754 |
Statements
Minimum deviation, quasi-LU factorization of nonsingular matrices (English)
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
0.7661649584770203
0 references
0.7616614699363708
0 references
0.7526796460151672
0 references
0.7363185882568359
0 references
0.7293136715888977
0 references