## 2015.29: Polynomial Eigenvalue Problems: Theory, Computation, and Structure

2015.29:
D. S. Mackey, N. Mackey and F. Tisseur
(2015)
*Polynomial Eigenvalue Problems: Theory, Computation, and Structure.*
In:
Peter Benner, Matthias Bollhoefer, Daniel Kressner and Tatjana Stykel, (eds).
Numerical Algebra, Matrix Theory, Differential-Algebraic Equations and Control Theory.
Springer International Publishing, Switzerland, pp. 319-348.
ISBN 978-3-319-15259-2

Full text available as:

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

## Abstract

Matrix polynomial eigenproblems arise in many application areas, both directly and as approximations for more general nonlinear eigenproblems. One of the most common strategies for solving a polynomial eigenproblem is via a linearization, which replaces the matrix polynomial by a matrix pencil with the same spectrum, and then computes with the pencil. Many matrix polynomials arising from applications have additional algebraic structure, leading to symmetries in the spectrum that are important for any computational method to respect. Thus it is useful to employ a structured linearization for a matrix polynomial with structure. This essay surveys the progress over the last decade in our understanding of linearizations and their construction, both with and without structure, and the impact this has had on numerical practice.

Item Type: | Book Section |
---|---|

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

MIMS number: | 2015.29 |

Deposited By: | Dr Françoise Tisseur |

Deposited On: | 12 May 2015 |

Download Statistics: last 4 weeks

Repository Staff Only: edit this item