Sturm and Sylvester algorithms revisited via tridiagonal determinantal representations

Simple item page
dc.creatorQuarez, Ronan
dc.date2008-11-14
dc.date.accessioned2026-07-07T10:18:27Z
dc.date.available2026-07-07T10:18:27Z
dc.descriptionFirst, 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.
dc.identifierhttps://arxiv.org/abs/0811.2365
dc.identifierhttp://arxiv.org/abs/0811.2365
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/174189
dc.subjectRings and Algebras
dc.subject12 - 15
dc.titleSturm and Sylvester algorithms revisited via tridiagonal determinantal representations
dc.typetext

Files

Collections

arXiv