Abstract
The deterministic recursive pivot-free algorithms for computing the generalized Bruhat decomposition of the matrix in the field and for the computation of the inverse matrix are presented. This method has the same complexity as algorithm of matrix multiplication, and it is suitable for the parallel computer systems.
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 serie. Soviet Math. Dokl. 23(2), 393–397 (1981)
Grigoriev, D.: Additive complexity in directed computations. Theoretical Computer Science 19, 39–67 (1982)
Kolotilina, L.Y.: Sparsity of Bruhat decomposition factors of nonsingular matrices. Notes of Scientific Seminars of LOMI 202, 5–17 (1992)
Kolotilina, L.Y., Yemin, A.Y.: Bruhat decomposition and solution of linear algebraic systems with sparse matrices. Sov. J. Numer. Anal. and Math. Model. 2, 421–436 (1987)
Strassen, V.: Gaussian Eelimination is not optimal. Numerische Mathematik 13, 354–356 (1969)
Malaschonok, G.I.: Effective matrix methods in commutative domains. In: Formal Power Series and Algebraic Combinatorics, pp. 506–517. Springer, Berlin (2000)
Malaschonok, G.I.: Matrix Computational Methods in Commutative Rings. Tambov State University, Tambov (2002)
Akritas, A., Malaschonok, G.: Computation of adjoint matrix. In: Alexandrov, V.N., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2006. LNCS, vol. 3992, pp. 486–489. Springer, Heidelberg (2006)
Bunch, J., Hopkroft, J.: Triangular factorization and inversion by fast matrix multiplication. Mat. Comp. 28, 231–236 (1974)
Watt, S.M.: Pivot-free block matrix inversion. In: Maple Conf. 2006, Waterloo, Canada, July 23-26 (2006), http://www.csd.uwo.ca/~watt/pub/reprints/2006-mc-bminv-poster.pdf
Watt, S.M.: Pivot-free block matrix inversion. In: Proc. 8th International Symposium on Symbolic and Numeric Algorithms in Symbolic Computation (SYNASC), pp. 151–155. IEEE Computer Society, Los Alamitos (2006)
Eberly, W.: Efficient parallel independent subsets and matrix factorization. In: Proc. 3rd IEEE Symposium on Parallel and Distributed Processing, Dallas, USA, pp. 204–211 (1991)
Kaltofen, E., Pan, V.: Processor-efficient parallel solution of linear systems over an abstract field. In: Proc. 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 180–191. ACM Press, New York (1991)
Kaltofen, E., Pan, V.: Processor-efficient parallel solution of linear systems II: The general case. In: Proc. 33rd IEEE Symposium on Foundations of Computer Science, Pittsburgh, USA, pp. 714–723 (1992)
Kaltofen, E., Pan, V.: Parallel solution of Toeplitz and Toeplitz-like linear systems over fields of small positive characteristic. In: Proc. PASCO 1994: First International Symposium on Parallel Symbolic Computation, pp. 225–233. World Scientific Publishing, Singapore (1994)
Malaschonok, G.I.: Parallel Algorithms of Computer Algebra. In: Proc. Conference Dedicated to the 75 Years of the Mathematical and Physical Dept. of Tambov State University, November 22-24, pp. 44–56. Tambov State Univ., Tambov (2005)
Malaschonok, G.I., Zuyev, M.S.: Generalized algorithm for computing of inverse matrix. In: 11th Conf. “Derzhavinskie Chteniya”, February 2-6, pp. 58–62. Tambov State Univ., Tambov (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Malaschonok, G. (2010). Fast Generalized Bruhat Decomposition. In: Gerdt, V.P., Koepf, W., Mayr, E.W., Vorozhtsov, E.V. (eds) Computer Algebra in Scientific Computing. CASC 2010. Lecture Notes in Computer Science, vol 6244. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15274-0_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-15274-0_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15273-3
Online ISBN: 978-3-642-15274-0
eBook Packages: Computer ScienceComputer Science (R0)