2011.86: An Algorithm for the Complete Solution of Quadratic Eigenvalue Problems
2011.86: Sven Hammarling, Christopher J. Munro and Francoise Tisseur (2011) An Algorithm for the Complete Solution of Quadratic Eigenvalue Problems.
This is the latest version of this eprint.
Full text available as:
|PDF - Archive staff only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader|
We develop a new algorithm for the computation of all the eigenvalues and optionally the right and left eigenvectors of dense quadratic matrix polynomials. It incorporates scaling of the problem parameters prior to the computation of eigenvalues, a choice of linearization with favorable conditioning and backward stability properties, and a preprocessing step that reveals and deflates the zero and infinite eigenvalues contributed by singular leading and trailing matrix coefficients. The algorithm is backward stable for quadratics that are not too heavily damped. Numerical experiments show that our MATLAB implementation of the algorithm, quadeig, outperforms the MATLAB function polyeig in terms of both stability and efficiency.
|Item Type:||MIMS Preprint|
|Subjects:||MSC 2000 > 65 Numerical analysis|
|Deposited By:||Dr Françoise Tisseur|
|Deposited On:||30 April 2012|
Available Versions of this Item
- An Algorithm for the Complete Solution of Quadratic Eigenvalue Problems (deposited 30 April 2012) [Currently Displayed]