A Hamiltonian Krylov-Schur-type method based on the symplectic Lanczos process
From MaRDI portal
Publication:541922
DOI10.1016/j.laa.2010.04.048zbMath1219.65040OpenAlexW1985799322WikidataQ115224050 ScholiaQ115224050MaRDI QIDQ541922
Peter Benner, Martin Stoll, Heike Fassbender
Publication date: 8 June 2011
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2010.04.048
convergencenumerical experimentsKrylov-Schur method\(SR\) algorithmHamiltonian eigenproblemHamiltonian SR methodimplicit restartingsymplectic Lanczos method
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Related Items
On the conditioning of factors in the SR decomposition ⋮ Some remarks on the complex \(J\)-symmetric eigenproblem ⋮ Structured shifts for skew-symmetric matrices ⋮ On the solution of large-scale algebraic Riccati equations by using low-dimensional invariant subspaces ⋮ Unnamed Item ⋮ A Krylov-Schur approach to the truncated SVD ⋮ Constraint-Satisfying Krylov Solvers for Structure-Preserving Discretizations ⋮ \(\mathcal{L}_{\infty}\)-norm computation for large-scale descriptor systems using structured iterative eigensolvers ⋮ Real fast structure-preserving algorithm for eigenproblem of complex Hermitian matrices ⋮ A thick-restart Lanczos type method for Hermitian \(J\)-symmetric eigenvalue problems ⋮ Numerical Linear Algebra Methods for Linear Differential-Algebraic Equations ⋮ Krylov projection methods for linear Hamiltonian systems ⋮ Trace minimization method via penalty for linear response eigenvalue problems ⋮ A Rational Even-IRA Algorithm for the Solution of $T$-Even Polynomial Eigenvalue Problems ⋮ Computing Symplectic Eigenpairs of Symmetric Positive-Definite Matrices via Trace Minimization and Riemannian Optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The parametrized \(SR\) algorithm for Hamiltonian matrices
- Solving large-scale quadratic eigenvalue problems with Hamiltonian eigenstructure using a structure-preserving Krylov subspace method
- Preserving geometric properties of the exponential matrix by block Krylov subspace methods
- A Schur decomposition for Hamiltonian matrices
- A bisection method for computing the \(H_{\infty}\) norm of a transfer matrix and related problems
- The autonomous linear quadratic control problem. Theory and numerical solution
- An implicit restarted Lanczos method for large symmetric eigenvalue problems
- 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
- Matrix factorizations for symplectic QR-like methods
- On Hamiltonian and symplectic Lanczos processes
- Structured eigenvalue methods for the computation of corner singularities in 3D anisotropic elastic structures
- Model reduction of state space systems via an implicitly restarted Lanczos method
- Canonical forms for Hamiltonian and symplectic matrices and pencils
- Reduced order control based on approximate inertial manifolds
- Passivity preserving model reduction via interpolation of spectral zeros
- A new result on passivity preserving model reduction
- Hamiltonian eigenvalue symmetry for quadratic operator eigenvalue problems
- An Implicitly Restarted Symplectic Lanczos Method for the Symplectic Eigenvalue Problem
- Structure-Preserving Methods for Computing Eigenpairs of Large Sparse Skew-Hamiltonian/Hamiltonian Pencils
- The Quadratic Eigenvalue Problem
- Matrix Algorithms
- A Krylov--Schur Algorithm for Large Eigenproblems
- The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
- Numerical methods for large eigenvalue problems
- Algorithm 854
- A Bisection Method for Measuring the Distance of a Stable Matrix to the Unstable Matrices
- Residual Bounds on Approximate Eigensystems of Nonnormal Matrices
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Canonical forms for symplectic and Hamiltonian matrices
- Robust stability and a criss-cross algorithm for pseudospectra
- Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
- A symplectic QR like algorithm for the solution of the real algebraic Riccati equation
- The Matrix Eigenvalue Problem
