Generalized Bruhat decomposition in commutative domains
arXiv:1702.07248 · doi:10.1007/978-3-319-02297-0_20
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.
References in corpus (1)
Cited by in corpus (5)
- Fast Computation of the Rank Profile Matrix and the Generalized Bruhat Decomposition
- Triangular Decomposition of Matrices in a Domain
- Recursive Matrix Algorithms in Commutative Domain for Cluster with Distributed Memory
- Recursive matrix algorithms, distributed dynamic control, scaling, stability
- LSU factorization