Structured Eigenvalue Problems
From MaRDI portal
Publication:3603885
DOI10.1002/gamm.201490035zbMath1177.65052OpenAlexW1488044055MaRDI QIDQ3603885
Daniel Kressner, Heike Fassbender
Publication date: 24 February 2009
Published in: GAMM-Mitteilungen (Search for Journal in Brave)
Full work available at URL: http://infoscience.epfl.ch/record/165568
algorithmseigenvalueinvariant subspacebackward errorsstructured matrixstructured condition numberssymmetric, skew-symmetric, persymmetric, block cyclic, Hamiltonian, symplectic, orthogonal matrices
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items
Generalized subspace iteration method for solving matrix pair eigenproblem ⋮ Finite-Dimensional Indefinite Inner Product Spaces and Applications in Numerical Analysis ⋮ Fast iterative solution of the Bethe-Salpeter eigenvalue problem using low-rank and QTT tensor approximation ⋮ Block circulant and Toeplitz structures in the linearized Hartree-Fock equation on finite lattices: tensor approach ⋮ Numerical dynamics of integrodifference equations ⋮ Computing the density of states for optical spectra of molecules by low-rank and QTT tensor approximation ⋮ Computing Floquet Hamiltonians with symmetries ⋮ A generalized circuit for the Hamiltonian dynamics through the truncated series ⋮ A robust numerical method for the \(\gamma\)-iteration in \(H_{\infty}\) control ⋮ A Core-Chasing Symplectic QR Algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solution of large scale algebraic matrix Riccati equations by use of hierarchical matrices
- Modelling nitrogen dynamics in citrus trees
- A divide and conquer method for unitary and orthogonal eigenproblems
- A symplectic method for approximating all the eigenvalues of a Hamiltonian matrix
- The QR algorithm for unitary Hessenberg matrices
- The weak and strong stability of algorithms in numerical linear algebra
- A bisection method for computing the \(H_{\infty}\) norm of a transfer matrix and related problems
- A Divide and Conquer method for the symmetric tridiagonal eigenproblem
- Schur parameter pencils for the solution of the unitary eigenproblem
- The autonomous linear quadratic control problem. Theory and numerical solution
- Multiparameter eigenvalue problems and expansion theorems
- Current inverse iteration software can fail
- 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
- Error bounds in the isometric Arnoldi process
- Backward error, condition numbers, and pseudospectra for the multiparameter eigenvalue problem.
- A divide-and-conquer algorithm for the eigendecomposition of symmetric block-diagonal plus semiseparable matrices
- Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices
- Symmetric centrosymmetric matrix-vector multiplication
- Perturbation analysis for the eigenvalue problem of a formal product of matrices
- On the condition of a complex eigenvalue under real perturbations
- Perturbation of eigenvalues for periodic matrix pairs via the Bauer-Fike theorems
- On Hamiltonian and symplectic Lanczos processes
- Computing matrix-vector products with centrosymmetric and centro-Hermitian matrices
- On the cubic convergence of the Paardekooper method
- Linear Hamiltonian difference systems: Disconjugacy and Jacobi-type conditions
- The periodic QR algorithm is a disguised QR algorithm
- Singular value decomposition and least squares solutions
- An eigenvalue algorithm for skew-symmetric matrices
- Structure-Preserving Methods for Computing Eigenpairs of Large Sparse Skew-Hamiltonian/Hamiltonian Pencils
- The Quadratic Eigenvalue Problem
- Perturbation Analysis of Hamiltonian Schur and Block-Schur Forms
- The Multishift QR Algorithm. Part I: Maintaining Well-Focused Shifts and Level 3 Performance
- The Multishift QR Algorithm. Part II: Aggressive Early Deflation
- Jacobi’s Method for Skew-Symmetric Matrices
- Diagonalization in Compact Lie Algebras and a New Proof of a Theorem of Kostant
- Convergence of the shifted $QR$ algorithm for unitary Hessenberg matrices
- A Jacobi-Like Method for the Automatic Computation of Eigenvalues and Eigenvectors of an Arbitrary Matrix
- Structured inverse eigenvalue problems
- Structured condition numbers of large Toeplitz matrices are rarely better than usual condition numbers
- A Jacobi-Like Algorithm for Computing the Schur Decomposition of a Nonhermitian Matrix
- A Hamiltonian $QR$ Algorithm
- Centrosymmetric (Cross-Symmetric) Matrices, Their Basic Properties, Eigenvalues, and Eigenvectors
- Derivatives and Perturbations of Eigenvectors
- 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
- Jacobi’s Method is More Accurate than QR
- Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems
- A General Matrix Eigenvalue Algorithm
- Eigensystem Computation for Skew-Symmetric and a Class of Symmetric Matrices
- Structured Backward Error and Condition of Generalized Eigenvalue Problems
- Numerical solution of the discrete-time periodic Riccati equation
- A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem
- Classroom Note: Some Eigenvalue Properties of Persymmetric Matrices
- ARPACK Users' Guide
- A Chart of Backward Errors for Singly and Doubly Structured Eigenvalue Problems
- A Continuation Method for a Right Definite Two-Parameter Eigenvalue Problem
- Orthogonal Eigenvectors and Relative Gaps
- Jacobi's Algorithm on Compact Lie Algebras
- Structure preserving algorithms for perplectic eigenproblems
- Deeper Inside PageRank
- Nonlinear eigenvalue problems: a challenge for modern eigenvalue methods
- Topics in the numerical linear algebra of Toeplitz and Hankel matrices
- Convergence of the unitary $QR$ algorithm with a unimodular Wilkinson shift
- Numerical Computation of Deflating Subspaces of Skew-Hamiltonian/Hamiltonian Pencils
- A Jacobi--Davidson Type Method for a Right Definite Two-Parameter Eigenvalue Problem
- Lanczos Algorithms for Large Symmetric Eigenvalue Computations
- On a Sturm Sequence of Polynomials for Unitary Hessenberg Matrices
- A fast minimal residual algorithm for shifted unitary matrices
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- On the Perturbation Theory for Unitary Eigenvalue Problems
- Product Eigenvalue Problems
- Convergence of the Isometric Arnoldi Process
- Perturbation Bounds for Isotropic Invariant Subspaces of Skew-Hamiltonian Matrices
- The Ehrlich--Aberth Method for the Nonsymmetric Tridiagonal Eigenvalue Problem
- Vector Spaces of Linearizations for Matrix Polynomials
- Structured Polynomial Eigenvalue Problems: Good Vibrations from Good Linearizations
- IMPROVED NUMERICAL FLOQUET MULTIPLIERS
- Existence of a low rank or ℋ︁‐matrix approximant to the solution of a Sylvester equation
- Multiparameter spectral theory
- An Algorithm for Generalized Matrix Eigenvalue Problems
- A symmetry exploiting Lanczos method for symmetric Toeplitz matrices
- Comparison of perturbation bounds for the stationary distribution of a Markov chain
- Perturbation analysis for the eigenproblem of periodic matrix pairs
