On the computation of few eigenvalues of positive definite Hamiltonian matrices

Authors:
Pierluigi Amodio
Affiliations:
Dipartimento di Matematica, Universití di Bari, Via E. Orabona 4, I-70125 Bari, Italy
Venue:
Future Generation Computer Systems
Year:
2006

Citing 7
Cited 0

A Hamiltonian QR algorithm

SIAM Journal on Scientific and Statistical Computing
Implicit application of polynomial filters in a k-step Arnoldi method

SIAM Journal on Matrix Analysis and Applications
The conditions for the reducibility and canonical forms of Hamiltonian matrices with pure imaginary eigenvalues

Computational Mathematics and Mathematical Physics
Computation of Stable Invariant Subspaces of Hamiltonian Matrices

SIAM Journal on Matrix Analysis and Applications
Algorithm 800: Fortran 77 subroutines for computing the eigenvalues of Hamiltonian matrices. I: the square-reduced method

ACM Transactions on Mathematical Software (TOMS)
Symplectic Balancing of Hamiltonian Matrices

SIAM Journal on Scientific Computing
A symplectic lanczos-type algorithm to compute the eigenvalues of positive definite hamiltonian matrices

ICCS'03 Proceedings of the 2003 international conference on Computational science: PartII

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a Hamiltonian matrix H=JS with S symmetric and positive definite, we analyze a symplectic Lanczos algorithm to transform -H^2 in a symmetric and positive definite tridiagonal matrix of half size. By means of two effective restarted procedures, this algorithm is then used to compute few extreme eigenvalues of H. Numerical examples are also reported to compare the presented techniques.