NANASep 20, 2014

A Contribution to the Numerics of Polynomials and Matrix Polynomials

arXiv:1409.5902h-index: 4
Originality Synthesis-oriented
AI Analysis

For researchers in numerical linear algebra, this is an incremental contribution offering algorithms for multiple eigenvalues, but with limited validation.

This paper presents algorithms for computing zeros of polynomials and eigenvalues of polynomial matrices with multiplicities greater than one, using MATLAB-generated starting values. The reliability is demonstrated on 8 examples, but no concrete numerical results are provided.

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.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes