Implicit QR algorithms for palindromic and even eigenvalue problems
From MaRDI portal
A structure preserving variant of the implicit QR algorithm is given for palindromic eigenvalue problems. The palindromic eigenvalue problem for an \((n,n)\) matrix \(A\) is to find \(\lambda\) such that \(Ax=\lambda A^* x\), \(x\neq 0\). The matrix \(A\) is said to be anti-triangular if \(a_{ij}= 0\), \(i+ j\leq n\) Given a matrix \(A\) the object of the algorithm is to reduce it to anti-triangular form. This is accomplished assuming the \(A\) is already reduced to an anti-Hessenberg matrix, \(a_{ij}= 0\), \(i+j\leq n\). A detailed description of the algorithm is presented together with application to an optimal control problem and a steel rail cooling problem. The algorithm is strongly backward stable and requires, less operations than the standard QZ algorithm.
Recommendations
- Palindromic and even eigenvalue problems -- analysis and numerical methods.
- Palindromic quadratization and structure-preserving algorithm for palindromic matrix polynomials of even degree
- Asymptotic perturbation of palindromic eigenvalue problems
- A new look at the doubling algorithm for a structured palindromic quadratic eigenvalue problem.
- Structured QR algorithms for Hamiltonian symmetric matrices
Cites work
- A Hamiltonian QR Algorithm
- A regularization algorithm for matrices of bilinear and sesquilinear forms
- A Symplectic Orthogonal Method for Single Input or Single Output Discrete Time Optimal Quadratic Control Problems
- Bounded and stably bounded palindromic difference equations of first order
- Canonical forms for complex matrix congruence and \(^{*}\)-congruence
- Computing eigenspaces with specified eigenvalues of a regular matrix pair (A,B) and condition estimation: Theory, algorithms and software
- Convergence of algorithms of decomposition type for the eigenvalue problem
- Eigenvalues, pseudospectrum and structured perturbations
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 192975 (Why is no real title available?)
- scientific article; zbMATH DE number 953050 (Why is no real title available?)
- Multishift Variants of the QZ Algorithm with Aggressive Early Deflation
- Numerical methods for general and structured eigenvalue problems.
- Numerical methods for palindromic eigenvalue problems: Computing the anti-triangular Schur form
- On Asymptotic Convergence of Nonsymmetric Jacobi Algorithms
- On swapping diagonal blocks in real Schur form
- On the Sensitivity of the Eigenvalue Problem Ax = \lambda Bx
- Palindromic and even eigenvalue problems -- analysis and numerical methods.
- Pencils of complex and real symmetric and skew matrices
- Perturbation theorems for the generalized eigenvalue problem
- Structured Condition Numbers for Invariant Subspaces
- Structured Hölder condition numbers for multiple eigenvalues
- Structured Polynomial Eigenvalue Problems: Good Vibrations from Good Linearizations
- The characteristic polynomial of a principal subpencil of a Hermitian matrix pencil
- The Matrix Eigenvalue Problem
- The multishift QR algorithm. I: Maintaining well-focused shifts and level 3 performance
- The multishift QR algorithm. II: Aggressive early deflation
- The transmission of shifts and shift blurring in the QR algorithm
- Theory of Decomposition and Bulge-Chasing Algorithms for the Generalized Eigenvalue Problem
Cited in
(58)- Iterative methods for the delay Lyapunov equation with T-Sylvester preconditioning
- A note on Sylvester-type equations
- On a relationship between the \(\operatorname{T}\)-congruence Sylvester equation and the Lyapunov equation
- Updating \(\star \)-palindromic quadratic systems with no spill-over
- Structured backward error for palindromic polynomial eigenvalue problems. II: Approximate eigentriplets
- Global FOM and GMRES algorithms for a class of complex matrix equations
- Fast verified computation for the solution of the T-congruence Sylvester equation
- The solution of the equation \(AX + X^{\star}B =0\)
- The Ehrlich-Aberth method for palindromic matrix polynomials represented in the Dickson basis
- Solvability and uniqueness criteria for generalized Sylvester-type equations
- Pole-swapping algorithms for alternating and palindromic eigenvalue problems
- Palindromic linearizations of palindromic matrix polynomials of odd degree obtained from Fiedler-like pencils
- A flexible global GCRO-DR method for shifted linear systems and general coupled matrix equations
- 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
- Recovering a perturbation of a matrix polynomial from a perturbation of its first companion linearization
- Geometry of matrix polynomial spaces
- On pole-swapping algorithms for the eigenvalue problem
- On the simultaneous refinement of the zeros of H-palindromic polynomials
- Relation between the T-congruence Sylvester equation and the generalized Sylvester equation
- On inverse eigenvalue problems of quadratic palindromic systems with partially prescribed eigenstructure
- On the calculation of neutral subspaces of a matrix
- Structure preserving stratification of skew-symmetric matrix polynomials
- The congruent centralizer of a block diagonal matrix
- A bisection method for measuring the distance of a quadratic matrix polynomial to the quadratic matrix polynomials that are singular on the unit circle
- Linearizations of matrix polynomials in Bernstein bases
- Numerical Linear Algebra Methods for Linear Differential-Algebraic 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
- The solution of the equation \(AX+BX^{\star}=0\)
- Numerical methods for palindromic eigenvalue problems: Computing the anti-triangular Schur form
- Backward errors and small-sample condition estimation for ⋆-Sylveter equations
- Computational Methods for Linear Matrix Equations
- A new look at the doubling algorithm for a structured palindromic quadratic eigenvalue problem.
- An implicitly-restarted Krylov subspace method for real symmetric/skew-symmetric eigenproblems
- A linear eigenvalue algorithm for the nonlinear eigenvalue problem
- Structured backward error analysis of linearized structured polynomial eigenvalue problems
- Strongly minimal self-conjugate linearizations for polynomial and rational matrices
- Structured eigenvalue backward errors of matrix pencils and polynomials with palindromic structures
- Palindromic and even eigenvalue problems -- analysis and numerical methods.
- LQ control of behavior systems in kernel representation
- On a transformation of the \(\ast\)-congruence Sylvester equation for the least squares optimization
- The solutions of the quaternion matrix equation \(AX^\varepsilon + BX^\delta = 0\)
- Palindromic matrix polynomials, matrix functions and integral representations
- Root-Max Problems, Hybrid Expansion-Contraction, and Quadratically Convergent Optimization of Passive Systems
- Palindromic quadratization and structure-preserving algorithm for palindromic matrix polynomials of even degree
- Palindromic companion forms for matrix polynomials of odd degree
- Para-Hermitian rational matrices
- A unified preconditioned minimal residual (PMR) algorithm for matrix problems: linear systems, multiple right-hand sides linear systems, least squares problems, inversion and pseudo-inversion with application to color image encryption
- Componentwise and normwise perturbation analysis for the anti-triangular Schur decomposition
- Deflating subspaces of T -palindromic pencils and algebraic T -Riccati equations
- Modifications of Newton's method for even-grade palindromic polynomials and other twined polynomials
- Solvability and uniqueness of solution of generalized -Sylvester equations with arbitrary coefficients
- Gradient descent-based parameter-free methods for solving coupled matrix equations and studying an application in dynamical systems
- Unified framework for Fiedler-like strong linearizations of polynomial and rational matrices
- Uniqueness of solution of a generalized \(\star\)-Sylvester matrix equation
- Contour integral solutions of Sylvester-type matrix equations
This page was built for publication: Implicit QR algorithms for palindromic and even eigenvalue problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1027778)
