Fast generalized Bruhat decomposition
From MaRDI portal
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.
Recommendations
Cites work
- Additive complexity in directed computations
- Computation of the Adjoint Matrix
- Gaussian elimination is not optimal
- scientific article; zbMATH DE number 4217769 (Why is no real title available?)
- scientific article; zbMATH DE number 1256710 (Why is no real title available?)
- scientific article; zbMATH DE number 1504614 (Why is no real title available?)
- scientific article; zbMATH DE number 766236 (Why is no real title available?)
- Triangular Factorization and Inversion by Fast Matrix Multiplication
Cited in
(12)- A practical approach to the secure computation of the Moore-Penrose pseudoinverse over the rationals
- Time and space efficient generators for quasiseparable matrices
- Fast computation of the rank profile matrix and the generalized Bruhat decomposition
- Expedited Broda-Damas bracket abstraction
- Hopf-theoretic approach to motives of twisted flag varieties
- Triangular decomposition of matrices in a domain
- A Further Refinement of the Bruhat Decomposition
- Bruhat Decomposition and Numerical Stability
- scientific article; zbMATH DE number 766236 (Why is no real title available?)
- Generalized Bruhat decomposition in commutative domains
- Matrix Bruhat decompositions with a remark on the QR(GR) algorithm
- Showcasing straight-line programs with memory via matrix Bruhat decomposition
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)
