New Structured Matrix Methods for Real and Complex Polynomial Root-finding

arXiv1311.6077MaRDI QIDQ6246718FDOQ6246718

Publication date: 23 November 2013

Abstract: We combine the known methods for univariate polynomial root-finding and for computations in the Frobenius matrix algebra with our novel techniques to advance numerical solution of a univariate polynomial equation, and in particular numerical approximation of the real roots of a polynomial. Our analysis and experiments show efficiency of the resulting algorithms.

This page was built for publication: New Structured Matrix Methods for Real and Complex Polynomial Root-finding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6246718)