| Autor: |
Malaschonok, Gennadi, Scherbinin, Anton |
| Rok vydání: |
2017 |
| Předmět: |
|
| Zdroj: |
Computer Algebra in Scientific Computing. LNCS 9301, Springer, Switzerland, 2015, P.290-304 |
| Druh dokumentu: |
Working Paper |
| DOI: |
10.1007/978-3-319-24021-3_22 |
| Popis: |
Deterministic recursive algorithms for the computation of matrix triangular decompositions with permutations like LU and Bruhat decomposition are presented for the case of commutative domains. This decomposition can be considered as a generalization of LU and Bruhat decompositions, because they both may be easily obtained from this triangular decomposition. Algorithms have the same complexity as the algorithm of matrix multiplication. |
| Databáze: |
arXiv |
| Externí odkaz: |
|
