Gauss-Bruhat decomposition as an example of Thomas decomposition (Q1018036)

Thomas decomposition [\textit{J. M. Thomas}, Differential Systems. IX + 118 p. New York, American Mathematical Society (American Mathematical Society Colloquium Publications Vol. XXI) (1937; JFM 63.0438.03)] is an algorithm for the decomposition of the solution set of a system of algebraic equations and inequations over an algebraically closed field into solution sets of triangular systems of algebraic equations and inequations of special type. This old and not so well-known method is being rediscovered because of its relevance for Computer Algebra, cf. [\textit{T. Bächler; V. Gerdt; M. Lange-Hegermann; D. Robertz}, in: Proc. CASC 2010, LNCS 6244, Springer, 31--54 (2010; Zbl 1202.68488)] or \textit{W. Plesken} [Arch. Math. 92, No. 1, 44--56 (2009; Zbl 1180.14053)]. In this paper, the Gauss-Bruhat decomposition and the LU decomposition of matrices are interpreted as instances of Thomas decompositions applied to the inequation \(\det(A)\neq 0\).