Equivalence between modified symplectic Gram-Schmidt and Householder SR algorithms
The SR factorization for a given matrix A is a QR-like factorization A=SR, where the matrix S is symplectic and R is J-upper triangular. This factorization is fundamental for some important structure-preserving methods in linear algebra and is usually implemented via the symplectic Gram-Schmidt algorithm (SGS).
symplectic gram-schmidt householder sr algorithm symplectic householder transformations msc 65f15 msc 65f50