An implicitly restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem

DOI10.1016/S0024-3795(96)00524-1zbMath0884.65028MaRDI QIDQ1368762

Peter Benner, Heike Fassbender

Publication date: 12 March 1998

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

zbMATH Keywords

numerical examplesimplicit restartHamiltonian matrixHamiltonian eigenvalue problemsymplectic Lanczos method

Mathematics Subject Classification ID

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

Related Items (39)

Balancing sparse Hamiltonian eigenproblems ⋮ Some remarks on the complex \(J\)-symmetric eigenproblem ⋮ Preserving geometric properties of the exponential matrix by block Krylov subspace methods ⋮ Structured shifts for skew-symmetric matrices ⋮ An invariant subspace method for large-scale algebraic Riccati equation ⋮ A new subspace iteration method for the algebraic Riccati equation ⋮ Fast iterative solution of the Bethe-Salpeter eigenvalue problem using low-rank and QTT tensor approximation ⋮ On the solution of large-scale algebraic Riccati equations by using low-dimensional invariant subspaces ⋮ An efficient and stable structure preserving algorithm for computing the eigenvalues of a Hamiltonian matrix ⋮ Unnamed Item ⋮ A Krylov-Schur approach to the truncated SVD ⋮ A collection of efficient retractions for the symplectic Stiefel manifold ⋮ Constraint-Satisfying Krylov Solvers for Structure-Preserving Discretizations ⋮ A structure preserving approximation method for Hamiltonian exponential matrices ⋮ Backward Error Analysis for Eigenproblems Involving Conjugate Symplectic Matrices ⋮ \(\mathcal{L}_{\infty}\)-norm computation for large-scale descriptor systems using structured iterative eigensolvers ⋮ Computing the density of states for optical spectra of molecules by low-rank and QTT tensor approximation ⋮ Block Arnoldi-based methods for large scale discrete-time algebraic Riccati equations ⋮ Equivalence between modified symplectic Gram-Schmidt and Householder SR algorithms ⋮ Krylov integrators for Hamiltonian systems ⋮ Optimal symplectic Householder transformations for \(SR\) decomposition ⋮ Global symplectic Lanczos method with application to matrix exponential approximation ⋮ A Structure Preserving Lanczos Algorithm for Computing the Optical Absorption Spectrum ⋮ A Hamiltonian Krylov-Schur-type method based on the symplectic Lanczos process ⋮ Numerical solution of large‐scale Lyapunov equations, Riccati equations, and linear‐quadratic optimal control problems ⋮ Nonlinear eigenvalue problems: a challenge for modern eigenvalue methods ⋮ On theoretical and numerical aspects of symplectic Gram-Schmidt-like algorithms ⋮ A thick-restart Lanczos type method for Hermitian \(J\)-symmetric eigenvalue problems ⋮ Error analysis of symplectic Lanczos method for Hamiltonian eigenvalue problem ⋮ Structured Eigenvalue Problems ⋮ A block \(J\)-Lanczos method for Hamiltonian matrices ⋮ Krylov projection methods for linear Hamiltonian systems ⋮ On Hamiltonian and symplectic Lanczos processes ⋮ Stabilization of Incompressible Flow Problems by Riccati-based Feedback ⋮ Hamiltonian eigenvalue symmetry for quadratic operator eigenvalue problems ⋮ The symplectic eigenvalue problem, the butterfly form, the SR algorithm, and the Lanczos method ⋮ Computing Symplectic Eigenpairs of Symmetric Positive-Definite Matrices via Trace Minimization and Riemannian Optimization ⋮ Inverses of \(2\times 2\) block matrices ⋮ Geometry of the symplectic Stiefel manifold endowed with the Euclidean metric

Uses Software

• eigs
• IRAM
• RICPAC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A symplectic method for approximating all the eigenvalues of a Hamiltonian matrix
• Solution of the large matrix equations which occur in response theory
• The weak and strong stability of algorithms in numerical linear algebra
• An analysis of the HR algorithm for computing the eigenvalues of a matrix
• The Riccati equation
• The autonomous linear quadratic control problem. Theory and numerical solution
• On some algebraic problems in connection with general eigenvalue algorithms
• A multishift algorithm for the numerical solution of algebraic Riccati equations
• An implicit restarted Lanczos method for large symmetric eigenvalue problems
• Matrix factorizations for symplectic QR-like methods
• Model reduction of state space systems via an implicitly restarted Lanczos method
• The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
• State-space solutions to standard H/sub 2/ and H/sub infinity / control problems
• A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
• A Hamiltonian $QR$ Algorithm
• A Bisection Method for Measuring the Distance of a Stable Matrix to the Unstable Matrices
• Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
• A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms, Part I
• A decomposition of near-optimum regulators for systems with slow and fast modes
• A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms. Part II
• Krylov Subspace Methods for Solving Large Lyapunov Equations
• A symplectic QR like algorithm for the solution of the real algebraic Riccati equation
• A Multilevel Technique for the Approximate Solution of Operator Lyapunov and Algebraic Riccati Equations
• An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
• On some algorithms for the solution of the complete eigenvalue problem

This page was built for publication: An implicitly restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem