## 2005.23: The Conditioning of Linearizations of Matrix Polynomials

2005.23:
Nicholas J. Higham, D. Steven Mackey and Françoise Tisseur
(2006)
*The Conditioning of Linearizations of
Matrix Polynomials.*
SIAM J. Matrix Anal. Appl., 28 (4).
pp. 1005-1028.
ISSN 0895-4798

*This is the latest version of this eprint.*

Full text available as:

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

DOI: 10.1137/050628283

## Abstract

The standard way of solving the polynomial eigenvalue problem of degree $m$ in $n\times n$ matrices is to ``linearize'' to a pencil in $mn\times mn$ matrices and solve the generalized eigenvalue problem. For a given polynomial, $P$, infinitely many linearizations exist and they can have widely varying eigenvalue condition numbers. We investigate the conditioning of linearizations from a vector space $\mathbb{DL}(P)$ of pencils recently identified and studied by Mackey, Mackey, Mehl, and Mehrmann. We look for the best conditioned linearization and compare the conditioning with that of the original polynomial. Two particular pencils are shown always to be almost optimal over linearizations in $\mathbb{DL}(P)$ for eigenvalues of modulus greater than or less than 1, respectively, provided that the problem is not too badly scaled and that the pencils are linearizations. Moreover, under this scaling assumption, these pencils are shown to be about as well conditioned as the original polynomial. For quadratic eigenvalue problems that are not too heavily damped, a simple scaling is shown to convert the problem to one that is well scaled. We also analyze the eigenvalue conditioning of the widely used first and second companion linearizations. The conditioning of the first companion linearization relative to that of $P$ is shown to depend on the coefficient matrix norms, the eigenvalue, and the left \ev s of the linearization and of $P$. The companion form is found to be potentially much more ill conditioned than $P$, but if the 2-norms of the coefficient matrices are all approximately 1 then the companion form and $P$ are guaranteed to have similar condition numbers. Analogous results hold for the second companion form. Our results are phrased in terms of both the standard relative condition number and the condition number of Dedieu and Tisseur for the problem in homogeneous form, this latter condition number having the advantage of applying to zero and infinite eigenvalues.

Item Type: | Article |
---|---|

Uncontrolled Keywords: | matrix polynomial, matrix pencil, linearization, companion form, condition number, homogeneous form, quadratic eigenvalue problem, vector space, scaling |

Subjects: | MSC 2000 > 15 Linear and multilinear algebra; matrix theory MSC 2000 > 65 Numerical analysis |

MIMS number: | 2005.23 |

Deposited By: | Nick Higham |

Deposited On: | 19 December 2006 |

### Available Versions of this Item

- The Conditioning of Linearizations of
Matrix Polynomials (deposited 19 December 2006)
**[Currently Displayed]**

Download Statistics: last 4 weeks

Repository Staff Only: edit this item