Triangular decomposition of matrices in a domain

DOI10.1007/978-3-319-24021-3_22MaRDI QIDQ3454552zbMATH OpenOpenAlexFDO

Authors Gennadi I. Malaschonok, Anton Scherbinin

Publication date 25 November 2015

Published in Computer Algebra in Scientific Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1702.07243

Mathematics Subject Classification ID

Factorization of matrices (15A23) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Numerical linear algebra (65F99)

Abstract: 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.

Recommendations

• Generalized Bruhat decomposition in commutative domains
• Fast generalized Bruhat decomposition
• scientific article; zbMATH DE number 766236
• Triangular \(x\)-basis decompositions and derandomization of linear algebra algorithms over \(K[x]\)
• Algorithms for computing triangular decomposition of polynomial systems

Cited in

(14)

• Gauss-Bruhat decomposition as an example of Thomas decomposition
• On the Gauss decomposition of a matrix
• Random matrices over a DVR and LU factorization
• On probabilistic algorithm for solving almost all instances of the set partition problem
• The triangular matrices of Gaussian elimination and related decompositions
• Analysis and comparison on the calculating characteristics of triangular decomposition algorithms
• Verification of the Redecoration Algorithm for Triangular Matrices
• Fast generalized Bruhat decomposition
• Generalized Bruhat decomposition in commutative domains
• On a decomposition of square matrices over a ring with identity
• Matrix Bruhat decompositions with a remark on the QR(GR) algorithm
• Showcasing straight-line programs with memory via matrix Bruhat decomposition
• The split decomposition of a tridiagonal pair
• Optimal triangular decompositions of matrices with entries from residuated lattices

This page was built for publication: Triangular decomposition of matrices in a domain

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3454552)