An algorithm for the Cartan-Dieudonné theorem on generalized scalar product spaces

We present an algorithmic proof of the theorem on generalized real scalar product spaces with arbitrary signature. We use Clifford algebras to compute the factorization of a given transformation as a product of reflections with respect to hyperplanes. The relationship with the Cartan-Dieudonné-Scherk theorem is also discussed in relation to the minimum number of reflections required to decompose a given orthogonal transformation.