An implicitly restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem (Q1368762): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: eigs / rank | |||
Normal rank | |||
Revision as of 15:47, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An implicitly restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem |
scientific article |
Statements
An implicitly restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem (English)
0 references
12 March 1998
0 references
A Lanczos algorithm for the numerical computation of the eigenvalues of a Hamiltonian matrix is derived. It computes a symplectic basis in which the matrix is block tridiagonal with Hamiltonian two by two blocks. It is shown how implicit restart can be applied. Several numerical examples are included.
0 references
symplectic Lanczos method
0 references
Hamiltonian eigenvalue problem
0 references
Hamiltonian matrix
0 references
implicit restart
0 references
numerical examples
0 references
