Speaker
Carolin Penke
Description
The QR decomposition is certainly among the most useful tools in the arsenal of numerical linear algebra, both in real as well as in complex arithmetic. Symplectic orthogonal QR decompositions follow a similar idea. They are less ubiquitous but find use in the context of Hamiltonian eigenvalue problems. We point out that an orthogonal symplectic QR decomposition is in fact the very same thing as a complex unitary QR decomposition.
