A Symplectic Lanczos-Type Algorithm to Compute the Eigenvalues of Positive Definite Hamiltonian Matrices

DOI10.1007/3-540-44862-4_16zbMath1147.65305OpenAlexW1586605188MaRDI QIDQ3527795

Pierluigi Amodio

Publication date: 30 September 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-44862-4_16

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items (5)

Structured shifts for skew-symmetric matrices ⋮ Unnamed Item ⋮ A collection of efficient retractions for the symplectic Stiefel manifold ⋮ A note on the numerical solution of complex Hamiltonian and skew-Hamiltonian eigenvalue problems ⋮ Computing Symplectic Eigenpairs of Symmetric Positive-Definite Matrices via Trace Minimization and Riemannian Optimization

This page was built for publication: A Symplectic Lanczos-Type Algorithm to Compute the Eigenvalues of Positive Definite Hamiltonian Matrices