A Contribution to the Numerics of Polynomials and Matrix Polynomials

2014/09/20 by Sigurd Falk, Falk, Sigurd
Computer Science · Physics and Astronomy · #Matrix Theory and Algorithms #Advanced Mathematical Theories and Applications

paper · pdf · doi:10.48550/arxiv.1409.5902

Abstract

In this paper some algorithms will be presented which can be used for the calculation of zeros of polynomials and eigenvalues of polynomial matrices with a multiplicity larger than one. The numerical values calculated with MATLAB are used as starting values. The reliability of the algorithms is demonstrated by means of 8 examples.

Related

• Locating the eigenvalues of matrix polynomials
• Fast Algorithms for Computing Eigenvectors of Matrices via Pseudo Annihilating Polynomials
• Fast Approximation of Polynomial Zeros and Matrix Eigenvalues
• Bounds for the Zeros of Quaternionic Polynomials and Regular Functions Using Matrix Techniques
• Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method