ON FAST GENERALIZED BRUHAT DECOMPOSITION IN THE DOMAINS.
We consider a deterministic recursive algorithm for computing the generalized Bruhat decomposition for matrices over commutative domains. The computational complexity of this algorithm is equals the complexity of matrix multiplication. The algorithm is included in the Mathpar algorithms library.