整环上矩阵的三角分解
Triangular Decomposition of Matrices in a Domain
摘要：
给出了交换域上矩阵三角分解的确定性递归算法。这种分解可以被认为是LU和Bruhat分解的推广，因为它们都可以很容易地从这种三角分解中获得。算法的复杂度与矩阵乘法算法相同。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
