Abstract
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.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
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)
Grigoriev, D.: Additive complexity in directed computations. Theoretical Computer Science 19, 39–67 (1982)
Malaschonok, G.: Fast Generalized Bruhat Decomposition. In: Gerdt, V.P., Koepf, W., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2010. LNCS, vol. 6244, pp. 194–202. Springer, Heidelberg (2010)
Malaschonok, G.I.: Matrix Computational Methods in Commutative Rings. Tambov University Publishing House, Tambov (2002)
Malaschonok, G.I.: Effective matrix methods in commutative domains. In: Krob, D., Mikhalev, A.A., Mikhalev, A.V. (eds.) Formal Power Series and Algebraic Combinatorics, pp. 506–517. Springer, Berlin (2000)
Malaschonok, G.I.: A fast algorithm for adjoint matrix computation. Tambov University Reports 5(1), 142–146 (2000)
Malaschonok, G.I.: Fast matrix decomposition in parallel computer algebra. Tambov University Reports 15(4), 1372–1385 (2010)
Malaschonok, G.I.: On the fast generalized Bruhat decomposition in domains. Tambov University Reports 17(2), 544–550 (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this paper
Cite this paper
Malaschonok, G. (2013). Generalized Bruhat Decomposition in Commutative Domains. In: Gerdt, V.P., Koepf, W., Mayr, E.W., Vorozhtsov, E.V. (eds) Computer Algebra in Scientific Computing. CASC 2013. Lecture Notes in Computer Science, vol 8136. Springer, Cham. https://doi.org/10.1007/978-3-319-02297-0_20
Download citation
DOI: https://doi.org/10.1007/978-3-319-02297-0_20
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-02296-3
Online ISBN: 978-3-319-02297-0
eBook Packages: Computer ScienceComputer Science (R0)