The symplectic eigenvalue problem, the butterfly form, the SR algorithm, and the Lanczos method

DOI10.1016/S0024-3795(97)10049-0zbMath0935.65030MaRDI QIDQ1307194

Peter Benner, Heike Fassbender

Publication date: 28 October 1999

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

zbMATH Keywords

reduction; symplectic matrices; symplectic Lanczos method; SR algorithm; symplectic butterfly form; symplectic eigenvalue problem

Mathematics Subject Classification ID

65F50: Computational methods for sparse matrices

65F15: Numerical computation of eigenvalues and eigenvectors of matrices

Related Items

Nonlinear eigenvalue problems: a challenge for modern eigenvalue methods, \(SR\) and \(SZ\) algorithms for the symplectic (butterfly) eigenproblem, Two connections between the \(SR\) and \(HR\) eigenvalue algorithms, On Hamiltonian and symplectic Lanczos processes, The parameterized 𝑆𝑅 algorithm for symplectic (butterfly) matrices

Uses Software

• eigs
• IRAM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a condensed form for normal matrices under finite sequences of elementary unitary similarities
• Convergence of algorithms of decomposition type for the eigenvalue problem
• On Hamiltonian and symplectic Hessenberg forms
• A Schur decomposition for Hamiltonian matrices
• A symplectic method for approximating all the eigenvalues of a Hamiltonian matrix
• A new method for computing the closed-loop eigenvalues of a discrete-time algebraic Riccati equation
• The weak and strong stability of algorithms in numerical linear algebra
• Schur parameter pencils for the solution of the unitary eigenproblem
• The Riccati equation
• The autonomous linear quadratic control problem. Theory and numerical solution
• Numerical linear algorithms and group theory
• On some algebraic problems in connection with general eigenvalue algorithms
• On computing the eigenvalues of a symplectic pencil
• An implicit restarted Lanczos method for large symmetric eigenvalue problems
• An implicitly restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem
• Matrix factorizations for symplectic QR-like methods
• Model reduction of state space systems via an implicitly restarted Lanczos method
• An Implicitly Restarted Symplectic Lanczos Method for the Symplectic Eigenvalue Problem
• On numerical methods for discrete least-squares approximation by trigonometric polynomials
• Some Perspectives on the Eigenvalue Problem
• The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
• Chasing Algorithms for the Eigenvalue Problem
• A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
• A Symplectic Orthogonal Method for Single Input or Single Output Discrete Time Optimal Quadratic Control Problems
• On the numerical solution of the discrete-time algebraic Riccati equation
• Stability radii of linear discrete‐time systems and symplectic pencils
• Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
• A symplectic QR like algorithm for the solution of the real algebraic Riccati equation
• The Problem of Lateral Buckling of Cantilever Plates
• An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
• On some algorithms for the solution of the complete eigenvalue problem