The proceeding at: 6th Conference on Structured Numerical Linear and Multilinear Algebra: Analysis, Algorithms and Applications (SLA 2014), took place at 2014, Septembe 8-12, in Kalamata (Grece),Computing roots of scalar polynomials as the eigenvalues of Frobenius companion matrices using backward stable eigenvalue algorithms is a classical approach. The introduction of new families of companion matrices allows for the use of other matrices in the root-finding problem. In this paper, we analyze the backward stability of polynomial root-finding algorithms via Fiedler companion matrices. In other words, given a polynomial p(z), the question is to determine whether the whole set of computed eigenvalues of the companion matrix, obtained with a ...
Several matrix norms of the classical Frobenius companion matrices of a monic polynomial p(z) have b...
A common way of computing the roots of a polynomial is to find the eigenvalues of a linearization,...
We introduce a new family of strong linearizations of matrix polynomials---which we call "block Kron...
The proceeding at: 6th Conference on Structured Numerical Linear and Multilinear Algebra: Analysis, ...
{Computing roots of scalar polynomials as the eigenvalues of Frobenius companion matrices using back...
Computing roots of scalar polynomials as the eigenvalues of Frobenius companion matrices using backw...
This work is a continuation of work by [J. L. Aurentz, T. Mach, R. Vandebril, and D. S. Watkins, J. ...
Computing the roots of a scalar polynomial, or the eigenvalues of a matrix polynomial, expressed in ...
The standard way to solve polynomial eigenvalue problems is through linearizations. The family of F...
The aim of the present paper is to analyze the behavior of Fiedler companion matrices in the polynom...
A standard approach to compute the roots of a univariate polynomial is to compute the eigenvalues of...
The aim of the present paper is to analyze the behavior of Fiedler companion matrices in the polynom...
A standard approach to calculate the roots of a univariate polynomial is to compute the eigenvalues ...
This report is a continuation of "Fast and backward stable computation of roots of polynomials" by J...
The first and second Frobenius companion matrices appear frequently in numerical application, but i...
Several matrix norms of the classical Frobenius companion matrices of a monic polynomial p(z) have b...
A common way of computing the roots of a polynomial is to find the eigenvalues of a linearization,...
We introduce a new family of strong linearizations of matrix polynomials---which we call "block Kron...
The proceeding at: 6th Conference on Structured Numerical Linear and Multilinear Algebra: Analysis, ...
{Computing roots of scalar polynomials as the eigenvalues of Frobenius companion matrices using back...
Computing roots of scalar polynomials as the eigenvalues of Frobenius companion matrices using backw...
This work is a continuation of work by [J. L. Aurentz, T. Mach, R. Vandebril, and D. S. Watkins, J. ...
Computing the roots of a scalar polynomial, or the eigenvalues of a matrix polynomial, expressed in ...
The standard way to solve polynomial eigenvalue problems is through linearizations. The family of F...
The aim of the present paper is to analyze the behavior of Fiedler companion matrices in the polynom...
A standard approach to compute the roots of a univariate polynomial is to compute the eigenvalues of...
The aim of the present paper is to analyze the behavior of Fiedler companion matrices in the polynom...
A standard approach to calculate the roots of a univariate polynomial is to compute the eigenvalues ...
This report is a continuation of "Fast and backward stable computation of roots of polynomials" by J...
The first and second Frobenius companion matrices appear frequently in numerical application, but i...
Several matrix norms of the classical Frobenius companion matrices of a monic polynomial p(z) have b...
A common way of computing the roots of a polynomial is to find the eigenvalues of a linearization,...
We introduce a new family of strong linearizations of matrix polynomials---which we call "block Kron...