Fast generalized Bruhat decomposition
arXiv:1702.07242 · doi:10.1007/978-3-642-15274-0_16
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.
References in corpus (1)
Cited by in corpus (7)
- Fast Computation of the Rank Profile Matrix and the Generalized Bruhat Decomposition
- Generalized Bruhat decomposition in commutative domains
- Triangular Decomposition of Matrices in a Domain
- Hopf-theoretic approach to motives of twisted flag varieties
- Recursive Matrix Algorithms in Commutative Domain for Cluster with Distributed Memory
- Recursive matrix algorithms, distributed dynamic control, scaling, stability
- LSU factorization