One of the most frequently used techniques to solve polynomial eigenvalue problems is linearization, in which the polynomial eigenvalue problem is turned into an equivalent linear eigenvalue problemâ€¦ (More)

This article describes an efficient and robust algorithm and implementation for the evaluation of the Wright Ï‰ function in IEEE double precision arithmetic over the complex plane.

The need to solve polynomial eigenvalue problems for matrix polynomials expressed in nonmonomial bases has become a very important problem. Among the most important bases in numerical applicationsâ€¦ (More)

Computing the roots of a univariate polynomial can be reduced to computing the eigenvalues of an associated companion matrix. For the monomial basis, these computations have been shown to beâ€¦ (More)

This article considers the backward error of the solution of polynomial eigenvalue problems expressed as Lagrange interpolants. One of the most common strategies to solve polynomial eigenvalueâ€¦ (More)

For a barycentric Lagrange interpolant p(z), the roots of p(z) are exactly the eigenvalues of a generalized companion matrix pair (A,B). For real interpolation nodes, the matrix pair (A,B) can beâ€¦ (More)

Computing the roots of a polynomial expressed in the Lagrange basis or a Hermite interpolational basis can be reduced to computing the eigenvalues of the corresponding companion matrix [2]. Theâ€¦ (More)