Balancing sparse Hamiltonian eigenproblems

DOI10.1016/j.laa.2004.09.023zbMath1092.65026MaRDI QIDQ2368735

Daniel Kressner, Peter Benner

Publication date: 28 April 2006

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

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

zbMATH Keywords

algorithms; numerical examples; balancing; eigenvalue problems; sparse Hamiltonian matrices; symplectic scaling matrix

Mathematics Subject Classification ID

65F50: Computational methods for sparse matrices

65F15: Numerical computation of eigenvalues and eigenvectors of matrices

Uses Software

• LAPACK
• LEDA
• ARPACK
• Algorithm 800
• CAREX
• benchmodred

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A symplectic method for approximating all the eigenvalues of a Hamiltonian matrix
• The autonomous linear quadratic control problem. Theory and numerical solution
• The shift-inverted \(J\)-Lanczos algorithm for the numerical solutions of large sparse algebraic Riccati equations
• 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
• Block algorithms for orthogonal symplectic factorizations
• Balancing sparse matrices for computing eigenvalues
• Balancing a matrix for calculation of eigenvalues and eigenvectors
• Symplectic Balancing of Hamiltonian Matrices
• Structure-Preserving Methods for Computing Eigenpairs of Large Sparse Skew-Hamiltonian/Hamiltonian Pencils
• On Pre-Conditioning of Matrices
• A Hamiltonian $QR$ Algorithm
• LAPACK Users' Guide
• An Implementation of Tarjan's Algorithm for the Block Triangularization of a Matrix
• ARPACK Users' Guide
• Algorithm 800
• Depth-First Search and Linear Graph Algorithms