An algorithm for the Cartan-Dieudonn\'e theorem on generalized scalar product spaces
Linear Algebra and its Applications, 434 (2011) 1238-1254 We present an algorithmic proof of the Cartan-Dieudonn\'e theorem on generalized real scalar product spaces with arbitrary signature. We use Clifford algebras to compute the factorization of a given orthogonal transformation as a product...
Gespeichert in:
Hauptverfasser: | , , , |
---|---|
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Linear Algebra and its Applications, 434 (2011) 1238-1254 We present an algorithmic proof of the Cartan-Dieudonn\'e theorem on
generalized real scalar product spaces with arbitrary signature. We use
Clifford algebras to compute the factorization of a given orthogonal
transformation as a product of reflections with respect to hyperplanes. The
relationship with the Cartan-Dieudonn\'e-Scherk theorem is also discussed in
relation to the minimum number of reflections required to decompose a given
orthogonal transformation. |
---|---|
DOI: | 10.48550/arxiv.1011.1027 |