The parametrized SR algorithm for Hamiltonian matrices

zbMATH Open1171.65375MaRDI QIDQ836664FDOQ836664

Authors: Heike Faßbender 

Publication date: 8 September 2009

Published in: ETNA - Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/130658

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• scientific article
• An extended Hamiltonian algorithm for the general linear matrix equation
• Structured QR algorithms for Hamiltonian symmetric matrices
• The parameterized \(SR\) algorithm for symplectic (butterfly) matrices
• An efficient and stable structure preserving algorithm for computing the eigenvalues of a Hamiltonian matrix
• A structure preserving approximation method for Hamiltonian exponential matrices
• Lanczos type algorithms for Hamiltonian eigenvalue problems
• The Hamiltonian extended Krylov subspace method
• Symplectic algorithm for testing the Hamiltonian matrix
• A Schur decomposition for Hamiltonian matrices

zbMATH Keywords

eigenvalue problemHamiltonian matrix\(SR\) algorithmrestarted symplectic Lanczos method

Mathematics Subject Classification ID

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

Cited In (5)

• Title not available (Why is that?)
• Some remarks on the complex \(J\)-symmetric eigenproblem
• A Hamiltonian Krylov-Schur-type method based on the symplectic Lanczos process
• The parameterized \(SR\) algorithm for symplectic (butterfly) matrices
• Structure preserving parallel algorithms for solving the Bethe-Salpeter eigenvalue problem

This page was built for publication: The parametrized \(SR\) algorithm for Hamiltonian matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q836664)