2010.33: Structured Linearizations for Palindromic Matrix Polynomials of Odd Degree

2010.33: Fernando De Teran, Froilan M. Dopico and D. Steven Mackey (2010) Structured Linearizations for Palindromic Matrix Polynomials of Odd Degree.

There is a more recent version of this eprint available. Click here to view it.

Full text available as:

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 186 Kb

Abstract

The standard way to solve polynomial eigenvalue problems $P(\la)x=0$ is to convert the matrix polynomial $P(\la)$ into a matrix pencil that preserves its spectral information-- a process known as linearization. When $P(\la)$ is palindromic, the eigenvalues, elementary divisors, and minimal indices of $P(\la)$ have certain symmetries that can be lost when using the classical first and second companion linearizations for numerical computations, since these linearizations do not preserve the palindromic structure. Recently new families of linearizations have been introduced with the goal of finding linearizations that retain whatever structure that the original $P(\la)$ might possess, with particular attention paid to the preservation of palindromic structure. However, no general construction of palindromic linearizations valid for all palindromic polynomials has as yet been achieved. In this paper we present a family of linearizations for odd degree polynomials $P(\la)$ which are palindromic whenever $P(\la)$ is, and which are valid for all palindromic polynomials of odd degree. We illustrate our construction with several examples. In addition, we establish a simple way to recover the minimal indices of the polynomial from those of the linearizations in the new family.

Available Versions of this Item

• Palindromic Companion Forms for Matrix Polynomials of Odd Degree (deposited 23 June 2011)
  • Structured Linearizations for Palindromic Matrix Polynomials of Odd Degree (deposited 19 April 2010) [Currently Displayed]

Download Statistics: last 4 weeks
Repository Staff Only: edit this item