  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.
