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.
Recommendations
- Spécialisation de la suite de Sturm
- Determinantal representation of trigonometric polynomial curves via Sylvester method
- General polynomial roots and their multiplicities inO(N)memory andO(N2)Time∗
- Roots of bivariate polynomial systems via determinantal representations
- scientific article; zbMATH DE number 1023365
Cites work
- A real symmetric tridiagonal matrix with a given characteristic polynomial
- Algorithms in real algebraic geometry
- Expressing a polynomial as the characteristic polynomial of a symmetric matrix
- Intertwining and testing matrices corresponding to a polynomial
- Linear matrix inequality representation of sets
- Noncommutative convexity arises from linear matrix inequalities
- On some structured inverse eigenvalue problems
- Pencils of real symmetric matrices and real algebraic curves
Cited in
(4)
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)