Palindromic quadratization and structure-preserving algorithm for palindromic matrix polynomials of even degree
DOI10.1007/S00211-011-0370-7zbMATH Open1222.65033OpenAlexW2002905417MaRDI QIDQ635809FDOQ635809
Publication date: 23 August 2011
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: http://ntur.lib.ntu.edu.tw/bitstream/246246/238881/-1/35.pdf
Recommendations
- Palindromic companion forms for matrix polynomials of odd degree
- Implicit QR algorithms for palindromic and even eigenvalue problems
- Palindromic and even eigenvalue problems -- analysis and numerical methods.
- Palindromic linearizations of palindromic matrix polynomials of odd degree obtained from Fiedler-like pencils
- Palindromic linearizations of a matrix polynomial of odd degreee obtained from Fiedler pencils with repetition
eigenvalue problempalindromic polynomial\texttt{MATLAB}palindromic quadratic pencilPatel algorithmquadratization, structure preserving
Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Cites Work
- Structure-Preserving Algorithms for Palindromic Quadratic Eigenvalue Problems Arising from Vibration of Fast Trains
- Structured Polynomial Eigenvalue Problems: Good Vibrations from Good Linearizations
- The quadratic eigenvalue problem
- Numerical methods for palindromic eigenvalue problems: Computing the anti-triangular Schur form
- A framework for analyzing nonlinear eigenproblems and parametrized linear systems
- Vector Spaces of Linearizations for Matrix Polynomials
- Vibration of fast trains, palindromic eigenvalue problems and structure-preserving doubling algorithms
- On computing the eigenvalues of a symplectic pencil
- Detecting a definite Hermitian pair and a hyperbolic or elliptic quadratic eigenvalue problem, and associated nearness problems
- Normwise Scaling of Second Order Polynomial Matrices
- Backward Error of Polynomial Eigenproblems Solved by Linearization
- Optimal Scaling of Generalized and Polynomial Eigenvalue Problems
- A new method for computing the closed-loop eigenvalues of a discrete-time algebraic Riccati equation
- Balancing sparse matrices for computing eigenvalues
- Structured doubling algorithms for solving g-palindromic quadratic eigenvalue problems
- Balancing Regular Matrix Pencils
- On equivalence of pencils from discrete-time and continuous-time control
Cited In (12)
- Block minimal bases \(\ell\)-ifications of matrix polynomials
- Spectral equivalence of matrix polynomials and the index sum theorem
- A framework for analyzing nonlinear eigenproblems and parametrized linear systems
- Structured strong $\boldsymbol{\ell}$-ifications for structured matrix polynomials in the monomial basis
- The Ehrlich-Aberth method for palindromic matrix polynomials represented in the Dickson basis
- Structured backward error for palindromic polynomial eigenvalue problems. II: Approximate eigentriplets
- Quadratic realizability of palindromic matrix polynomials: the real case
- Palindromic linearizations of a matrix polynomial of odd degreee obtained from Fiedler pencils with repetition
- Quadratic realizability of palindromic matrix polynomials
- A parametrization of structure-preserving transformations for matrix polynomials
- Structured backward error analysis of linearized structured polynomial eigenvalue problems
- Constructing strong \(\ell\)-ifications from dual minimal bases
Uses Software
This page was built for publication: Palindromic quadratization and structure-preserving algorithm for palindromic matrix polynomials of even degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q635809)
