Sturm and Sylvester algorithms revisited via tridiagonal determinantal representations

From MaRDI portal
(Redirected from Publication:989047)




Abstract: First, we show that Sturm algorithm and Sylvester algorithm, which compute the number of real roots of a given univariate polynomial, lead to two dual tridiagonal determinantal representations of the polynomial. Next, we show that the number of real roots of a polynomial given by a tridiagonal determinantal representation is greater than the signature of this representation.









This page was built for publication: Sturm and Sylvester algorithms revisited via tridiagonal determinantal representations

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