Generalized Bruhat Decomposition in Commutative Domains
Deterministic recursive algorithms for the computation of generalized Bruhat decomposition of the matrix in commutative domain are presented. This method has the same complexity as the algorithm of matrix multiplication.
Unable to display preview. Download preview PDF.
- 1.Grigoriev, D.: Analogy of Bruhat decomposition for the closure of a cone of Chevalley group of a classical series. Soviet Math. Dokl. 23, 393–397 (1981)Google Scholar
- 4.Malaschonok, G.I.: Matrix Computational Methods in Commutative Rings. Tambov University Publishing House, Tambov (2002)Google Scholar
- 6.Malaschonok, G.I.: A fast algorithm for adjoint matrix computation. Tambov University Reports 5(1), 142–146 (2000)Google Scholar
- 8.Malaschonok, G.I.: On the fast generalized Bruhat decomposition in domains. Tambov University Reports 17(2), 544–550 (2012)Google Scholar