Numerical methods for palindromic eigenvalue problems: Computing the anti-triangular Schur form
DOI10.1002/nla.612zbMath1224.65099OpenAlexW2125453344MaRDI QIDQ3011665
Niloufer Mackey, D. Steven Mackey, Christian Mehl, Volker Mehrmann
Publication date: 29 June 2011
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: http://eprints.maths.manchester.ac.uk/1109/1/MacMMM08_final.pdf
eigenvalue problemill-conditioned problemsSchur formpalindromic matrix polynomialpalindromic pencilanti-triangular formpalindromic QR-algorithm
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Ill-posedness and regularization problems in numerical linear algebra (65F22) Matrix pencils (15A22)
Related Items (30)
Cites Work
- Unnamed Item
- Implicit QR algorithms for palindromic and even eigenvalue problems
- Simultaneous equations models in applied search theory
- Some numerical experiments in triangularizing matrices
- The autonomous linear quadratic control problem. Theory and numerical solution
- Polynomial eigenvalue problems with Hamiltonian structure
- On Asymptotic Convergence of Nonsymmetric Jacobi Algorithms
- A Schur method for solving algebraic Riccati equations
- Jacobi-like Algorithms for the Indefinite Generalized Hermitian Eigenvalue Problem
- On the Schur Decomposition of a Matrix for Parallel Computation
- Structured Polynomial Eigenvalue Problems: Good Vibrations from Good Linearizations
- Symmetric Linearizations for Matrix Polynomials
- A Method for Finding Roots of Arbitrary Matrices
This page was built for publication: Numerical methods for palindromic eigenvalue problems: Computing the anti-triangular Schur form