Implicit QR algorithms for palindromic and even eigenvalue problems

DOI10.1007/s11075-008-9226-3zbMath1181.65054OpenAlexW2123520000MaRDI QIDQ1027778

Daniel Kressner, David S. Watkins, Christian Schröder

Publication date: 30 June 2009

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://infoscience.epfl.ch/record/165582/files/ksw.pdf

zbMATH Keywords

optimal controlimplicit QR algorithmpalindromic eigenvalue problems

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Canonical forms, reductions, classification (15A21)

Related Items (47)

Iterative methods for the delay Lyapunov equation with T-Sylvester preconditioning ⋮ Linearizations of matrix polynomials in Bernstein bases ⋮ On the calculation of neutral subspaces of a matrix ⋮ Backward errors and small-sample condition estimation for ⋆-Sylveter equations ⋮ Computational Methods for Linear Matrix Equations ⋮ A note on Sylvester-type equations ⋮ Structure preserving stratification of skew-symmetric matrix polynomials ⋮ The congruent centralizer of a block diagonal matrix ⋮ On a relationship between the \(\operatorname{T}\)-congruence Sylvester equation and the Lyapunov equation ⋮ Palindromic matrix polynomials, matrix functions and integral representations ⋮ Strongly Minimal Self-Conjugate Linearizations for Polynomial and Rational Matrices ⋮ Geometry of matrix polynomial spaces ⋮ The solutions of the quaternion matrix equation \(AX^\varepsilon + BX^\delta = 0\) ⋮ The solution of the equation \(AX + X^{\star}B =0\) ⋮ An implicitly-restarted Krylov subspace method for real symmetric/skew-symmetric eigenproblems ⋮ The Ehrlich-Aberth method for palindromic matrix polynomials represented in the Dickson basis ⋮ Root-Max Problems, Hybrid Expansion-Contraction, and Quadratically Convergent Optimization of Passive Systems ⋮ Uniqueness of solution of a generalized \(\star\)-Sylvester matrix equation ⋮ Contour integral solutions of Sylvester-type matrix equations ⋮ Structured backward error analysis of linearized structured polynomial eigenvalue problems ⋮ A linear eigenvalue algorithm for the nonlinear eigenvalue problem ⋮ Updating \(\star \)-palindromic quadratic systems with no spill-over ⋮ On pole-swapping algorithms for the eigenvalue problem ⋮ Palindromic companion forms for matrix polynomials of odd degree ⋮ A bisection method for measuring the distance of a quadratic matrix polynomial to the quadratic matrix polynomials that are singular on the unit circle ⋮ Global FOM and GMRES algorithms for a class of complex matrix equations ⋮ Numerical methods for palindromic eigenvalue problems: Computing the anti-triangular Schur form ⋮ Fast verified computation for the solution of the T-congruence Sylvester equation ⋮ On the simultaneous refinement of the zeros of H-palindromic polynomials ⋮ Solvability and uniqueness criteria for generalized Sylvester-type equations ⋮ Modifications of Newton's method for even-grade palindromic polynomials and other twined polynomials ⋮ LQ control of behavior systems in kernel representation ⋮ Pole-swapping algorithms for alternating and palindromic eigenvalue problems ⋮ Palindromic linearizations of palindromic matrix polynomials of odd degree obtained from Fiedler-like pencils ⋮ Relation between the T-congruence Sylvester equation and the generalized Sylvester equation ⋮ On inverse eigenvalue problems of quadratic palindromic systems with partially prescribed eigenstructure ⋮ Numerical Linear Algebra Methods for Linear Differential-Algebraic Equations ⋮ A flexible global GCRO-DR method for shifted linear systems and general coupled matrix equations ⋮ Projection methods for large-scale T-Sylvester equations ⋮ A Fast Algorithm For Fast Train Palindromic Quadratic Eigenvalue Problems ⋮ The coupled Sylvester-transpose matrix equations over generalized centro-symmetric matrices ⋮ Structured Eigenvalue Backward Errors of Matrix Pencils and Polynomials with Palindromic Structures ⋮ On a transformation of the ∗-congruence Sylvester equation for the least squares optimization ⋮ Palindromic linearization and numerical solution of nonsymmetric algebraic \(T\)-Riccati equations ⋮ On why using \(\mathbb{DL}(P)\) for the symmetric polynomial eigenvalue problem might need to be reconsidered ⋮ The solution of the equationAX + BX^⋆ = 0 ⋮ Recovering a perturbation of a matrix polynomial from a perturbation of its first companion linearization

Uses Software

• PEPACK
• LYAPACK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence of algorithms of decomposition type for the eigenvalue problem
• Pencils of complex and real symmetric and skew matrices
• Eigenvalues, pseudospectrum and structured perturbations
• The characteristic polynomial of a principal subpencil of a Hermitian matrix pencil
• On swapping diagonal blocks in real Schur form
• Computing eigenspaces with specified eigenvalues of a regular matrix pair \((A,B)\) and condition estimation: Theory, algorithms and software
• Perturbation theorems for the generalized eigenvalue problem
• The transmission of shifts and shift blurring in the QR algorithm
• Numerical methods for general and structured eigenvalue problems.
• Canonical forms for complex matrix congruence and \(^{*}\)-congruence
• A regularization algorithm for matrices of bilinear and sesquilinear forms
• The Multishift QR Algorithm. Part I: Maintaining Well-Focused Shifts and Level 3 Performance
• The Multishift QR Algorithm. Part II: Aggressive Early Deflation
• Numerical methods for palindromic eigenvalue problems: Computing the anti-triangular Schur form
• Structured Condition Numbers for Invariant Subspaces
• On Asymptotic Convergence of Nonsymmetric Jacobi Algorithms
• A Hamiltonian $QR$ Algorithm
• A Symplectic Orthogonal Method for Single Input or Single Output Discrete Time Optimal Quadratic Control Problems
• Theory of Decomposition and Bulge-Chasing Algorithms for the Generalized Eigenvalue Problem
• Structured Hölder Condition Numbers for Multiple Eigenvalues
• Structured Polynomial Eigenvalue Problems: Good Vibrations from Good Linearizations
• The Matrix Eigenvalue Problem
• Multishift Variants of the QZ Algorithm with Aggressive Early Deflation
• Bounded and stably bounded palindromic difference equations of first order
• On the Sensitivity of the Eigenvalue Problem $Ax = \lambda Bx$

This page was built for publication: Implicit QR algorithms for palindromic and even eigenvalue problems