Backward errors and linearizations for palindromic matrix polynomials
نویسنده
چکیده
We derive computable expressions of structured backward errors of approximate eigenelements of ∗-palindromic and ∗-anti-palindromic matrix polynomials. We also characterize minimal structured perturbations such that approximate eigenelements are exact eigenelements of the perturbed polynomials. We detect structure preserving linearizations which have almost no adverse effect on the structured backward errors of approximate eigenelements of the ∗-palindromic and ∗-anti-palindromic polynomials.
منابع مشابه
On backward errors of structured polynomial eigenproblems solved by structure preserving linearizations
First, we derive explicit computable expressions of structured backward errors of approximate eigenelements of structured matrix polynomials including symmetric, skew-symmetric, Hermitian, skew-Hermitian, even and odd polynomials. We also determine minimal structured perturbations for which approximate eigenelements are exact eigenelements of the perturbed polynomials. Next, we analyze the effe...
متن کاملStructured Backward Error Analysis of Linearized Structured Polynomial Eigenvalue Problems
We start by introducing a new class of structured matrix polynomials, namely, the class of MA-structured matrix polynomials, to provide a common framework for many classes of structured matrix polynomials that are important in applications: the classes of (skew-)symmetric, (anti-)palindromic, and alternating matrix polynomials. Then, we introduce the families of MAstructured strong block minima...
متن کاملSmith Forms of Palindromic Matrix Polynomials
Many applications give rise to matrix polynomials whose coefficients have a kind of reversal symmetry, a structure we call palindromic. Several properties of scalar palindromic polynomials are derived, and together with properties of compound matrices, used to establish the Smith form of regular and singular T -palindromic matrix polynomials over arbitrary fields. The invariant polynomials are ...
متن کاملPalindromic companion forms for matrix polynomials of odd degree
The standard way to solve polynomial eigenvalue problems P (λ)x = 0 is to convert the matrix polynomial P (λ) into a matrix pencil that preserves its spectral information– a process known as linearization. When P (λ) is palindromic, the eigenvalues, elementary divisors, and minimal indices of P (λ) have certain symmetries that can be lost when using the classical first and second Frobenius comp...
متن کاملPalindromic linearizations of a matrix polynomial of odd degreee obtained from Fiedler pencils with repetition
Many applications give rise to structured, in particular T-palindromic, matrix polynomials. In order to solve a polynomial eigenvalue problem P (λ)x = 0, where P (λ) is a T-palindromic matrix polynomial, it is convenient to use palindromic linearizations to ensure that the symmetries in the eigenvalues, elementary divisors, and minimal indices of P (λ) due to the palindromicity are preserved. I...
متن کامل