Passivity-preserving model reduction via a computationally efficient project-and-balance scheme
Proceedings of the 41st annual Design Automation Conference
On the computation of few eigenvalues of positive definite Hamiltonian matrices
Future Generation Computer Systems
| Hi-index | 0.00 |
An implicitly restarted symplectic Lanczos method for the symplectic eigenvalue problem is presented. The Lanczos vectors are constructed to form a symplectic basis. The inherent numerical difficulties of the symplectic Lanczos method are addressed by inexpensive implicit restarts. The method is used to compute some eigenvalues and eigenvectors of large and sparse symplectic operators.