arXiv Open Access 2017

Triangular Decomposition of Matrices in a Domain

Gennadi Malaschonok Anton Scherbinin

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.SC

Penulis (2)

Gennadi Malaschonok

Anton Scherbinin

Format Sitasi

APA MLA BibTeX

Malaschonok, G., Scherbinin, A. (2017). Triangular Decomposition of Matrices in a Domain. https://arxiv.org/abs/1702.07243

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2017
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓