Sturm and Sylvester algorithms revisited via tridiagonal determinantal representations

DOI10.1016/J.LAA.2010.04.049zbMATH Open1232.12002arXiv0811.2365OpenAlexW2115843092MaRDI QIDQ989047FDOQ989047

Authors: Ronan Quarez 

Publication date: 27 August 2010

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/0811.2365

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(N²)Time^∗
• Roots of bivariate polynomial systems via determinantal representations
• scientific article; zbMATH DE number 1023365

zbMATH Keywords

polynomialsdeterminantsmatrix pencils

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Matrix pencils (15A22) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10)

Cites Work

• Algorithms in real algebraic geometry
• Linear matrix inequality representation of sets
• Pencils of real symmetric matrices and real algebraic curves
• Noncommutative convexity arises from linear matrix inequalities
• Expressing a polynomial as the characteristic polynomial of a symmetric matrix
• Intertwining and testing matrices corresponding to a polynomial
• A real symmetric tridiagonal matrix with a given characteristic polynomial
• On some structured inverse eigenvalue problems

Cited In (4)

• Determinantal representation of trigonometric polynomial curves via Sylvester method
• Title not available (Why is that?)
• Symmetric determinantal representation of polynomials
• A quadratic algebra associated with the Sturm sequence

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)