Some remarks on the complex \(J\)-symmetric eigenproblem

DOI10.1016/j.laa.2018.01.014zbMath1392.65086OpenAlexW2784010056WikidataQ130139661 ScholiaQ130139661MaRDI QIDQ1638013

Chao Yang, Peter Benner, Heike Fassbender

Publication date: 12 June 2018

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2018.01.014

zbMATH Keywords

structure-preservingSR algorithmcomplex \(J\)-symmetric eigenproblemcomplex Hamiltonian matrixreal Hamiltonian matrix

Mathematics Subject Classification ID

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

Related Items (8)

A classification of left-invariant symplectic structures on some Lie groups ⋮ Block circulant and Toeplitz structures in the linearized Hartree-Fock equation on finite lattices: tensor approach ⋮ Computing the density of states for optical spectra of molecules by low-rank and QTT tensor approximation ⋮ Efficient and accurate algorithms for solving the Bethe-Salpeter eigenvalue problem for crystalline systems ⋮ A Structure Preserving Lanczos Algorithm for Computing the Optical Absorption Spectrum ⋮ A thick-restart Lanczos type method for Hermitian \(J\)-symmetric eigenvalue problems ⋮ Left-invariant symplectic structures on diagonal almost abelian Lie groups ⋮ Replica analysis of the lattice-gas restricted Boltzmann machine partition function

Uses Software

• Algorithm 854

Cites Work

• Unnamed Item
• Unnamed Item
• A symmetric structure-preserving {\(\Gamma\)}QR algorithm for linear response eigenvalue problems
• A Hamiltonian Krylov-Schur-type method based on the symplectic Lanczos process
• Convergence of algorithms of decomposition type for the eigenvalue problem
• On Hamiltonian and symplectic Hessenberg forms
• The parametrized \(SR\) algorithm for Hamiltonian matrices
• Structure preserving parallel algorithms for solving the Bethe-Salpeter eigenvalue problem
• A note on the numerical solution of complex Hamiltonian and skew-Hamiltonian eigenvalue problems
• An implicitly restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem
• A numerically stable, structure preserving method for computing the eigenvalues of real Hamiltonian or symplectic pencils
• A new method for computing the stable invariant subspace of a real Hamiltonian matrix
• Eigenvalue computation in the 20th century
• Matrix factorizations for symplectic QR-like methods
• Breaking Van Loan’s Curse: A Quest forStructure-Preserving Algorithms for Dense Structured Eigenvalue Problems
• Algorithm 854
• On Asymptotic Convergence of Nonsymmetric Jacobi Algorithms
• A Chart of Numerical Methods for Structured Eigenvalue Problems
• Structured tools for structured matrices
• A symplectic QR like algorithm for the solution of the real algebraic Riccati equation
• Structured Factorizations in Scalar Product Spaces

This page was built for publication: Some remarks on the complex \(J\)-symmetric eigenproblem