Fast generalized Bruhat decomposition
From MaRDI portal
Publication:3589076
DOI10.1007/978-3-642-15274-0_16zbMATH Open1290.65038arXiv1702.07242OpenAlexW3125948407MaRDI QIDQ3589076FDOQ3589076
Authors: Gennadi I. Malaschonok 
Publication date: 10 September 2010
Published in: Computer Algebra in Scientific Computing (Search for Journal in Brave)
Abstract: The deterministic recursive pivot-free algorithms for the computation of 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.
Full work available at URL: https://arxiv.org/abs/1702.07242
Recommendations
Cites Work
- Gaussian elimination is not optimal
- Triangular Factorization and Inversion by Fast Matrix Multiplication
- Additive complexity in directed computations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computation of the Adjoint Matrix
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (11)
- Hopf-theoretic approach to motives of twisted flag varieties
- Fast computation of the rank profile matrix and the generalized Bruhat decomposition
- Title not available (Why is that?)
- A Further Refinement of the Bruhat Decomposition
- Generalized Bruhat decomposition in commutative domains
- Triangular decomposition of matrices in a domain
- Showcasing straight-line programs with memory via matrix Bruhat decomposition
- Time and space efficient generators for quasiseparable matrices
- Matrix Bruhat decompositions with a remark on the QR(GR) algorithm
- A practical approach to the secure computation of the Moore-Penrose pseudoinverse over the rationals
- Expedited Broda-Damas bracket abstraction
Uses Software
This page was built for publication: Fast generalized Bruhat decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3589076)
