2009.50: Perturbation, Computation and Refinement of Invariant Subspaces for Matrix Polynomials
2009.50: Timo Betcke and Daniel Kressner (2009) Perturbation, Computation and Refinement of Invariant Subspaces for Matrix Polynomials.
Full text available as:
|PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader|
Generalizing the notion of an eigenvector, invariant subspaces are frequently used in the context of linear eigenvalue problems, leading to conceptually elegant and numerically stable formulations in applications that require the computation of several eigenvalues and/or eigenvectors. Similar benefits can be expected for polynomial eigenvalue problems, for which the concept of invariant subspaces needs to be replaced by the concept of invariant pair. Little is known so far about numerical aspects of such invariant pairs. The aim of this paper is to fill this gap. The behavior of invariant pairs under perturbations of the matrix polynomial is studied and a first-order perturbation expansion is given. From a computational point of view, we investigate how to best extract invariant pairs from a linearization of the matrix polynomial. Moreover, we describe efficient refinement procedures directly based on the polynomial formulation. Numerical experiments with matrix polynomials from a number of applications demonstrate the effectiveness of our extraction and refinement procedures.
|Item Type:||MIMS Preprint|
|Uncontrolled Keywords:||invariant subspaces, condition number, polynomial eigenvalue problems, iterative refinement|
|Subjects:||MSC 2000 > 65 Numerical analysis|
|Deposited By:||Dr. Timo Betcke|
|Deposited On:||14 July 2009|