Necessary And Sufficient Conditions For Existence of the LU Factorization of an Arbitrary Matrix
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2005
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866914108255764480 |
|---|---|
| author | Okunev, Pavel Johnson, Charles R. |
| author_facet | Okunev, Pavel Johnson, Charles R. |
| contents | If $A$ is an n-by-n matrix over a field $F$ ($A\in M_{n}(F)$), then $A$ is said to ``have an LU factorization'' if there exists a lower triangular matrix $L\in M_{n}(F)$ and an upper triangular matrix $U\in M_{n}(F)$ such that $$A=LU.$$ We give necessary and sufficient conditions for LU factorability of a matrix. Also simple algorithm for computing an LU factorization is given. It is an extension of the Gaussian elimination algorithm to the case of not necessarily invertible matrices. We consider possibilities to factors a matrix that does not have an LU factorization as the product of an ``almost lower triangular'' matrix and an ``almost upper triangular'' matrix. There are many ways to formalize what almost means. We consider some of them and derive necessary and sufficient conditions. Also simple algorithms for computing of an ``almost LU factorization'' are given. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_math_0506382 |
| institution | arXiv |
| publishDate | 2005 |
| record_format | arxiv |
| spellingShingle | Necessary And Sufficient Conditions For Existence of the LU Factorization of an Arbitrary Matrix Okunev, Pavel Johnson, Charles R. Numerical Analysis General Mathematics If $A$ is an n-by-n matrix over a field $F$ ($A\in M_{n}(F)$), then $A$ is said to ``have an LU factorization'' if there exists a lower triangular matrix $L\in M_{n}(F)$ and an upper triangular matrix $U\in M_{n}(F)$ such that $$A=LU.$$ We give necessary and sufficient conditions for LU factorability of a matrix. Also simple algorithm for computing an LU factorization is given. It is an extension of the Gaussian elimination algorithm to the case of not necessarily invertible matrices. We consider possibilities to factors a matrix that does not have an LU factorization as the product of an ``almost lower triangular'' matrix and an ``almost upper triangular'' matrix. There are many ways to formalize what almost means. We consider some of them and derive necessary and sufficient conditions. Also simple algorithms for computing of an ``almost LU factorization'' are given. |
| title | Necessary And Sufficient Conditions For Existence of the LU Factorization of an Arbitrary Matrix |
| topic | Numerical Analysis General Mathematics |
| url | https://arxiv.org/abs/math/0506382 |