Pages that link to "Item:Q5929709"
From MaRDI portal
The following pages link to Sylvester-Habicht sequences and fast Cauchy index computation (Q5929709):
Displaying 33 items.
- Continuous amortization and extensions: with applications to bisection-based root isolation (Q277222) (← links)
- Solving bivariate systems using rational univariate representations (Q325154) (← links)
- Separating linear forms and rational univariate representations of bivariate systems (Q480646) (← links)
- Bivariate triangular decompositions in the presence of asymptotes (Q512372) (← links)
- On the topology of real algebraic plane curves (Q626980) (← links)
- A general approach to isolating roots of a bitstream polynomial (Q655157) (← links)
- SqFreeEVAL: An (almost) optimal real-root isolation algorithm (Q655566) (← links)
- Automatic computation of the complete root classification for a parametric polynomial (Q840716) (← links)
- A parametric representation of totally mixed Nash equilibria (Q979929) (← links)
- On the asymptotic and practical complexity of solving bivariate systems over the reals (Q1025391) (← links)
- An elementary approach to subresultants theory. (Q1401153) (← links)
- Subresultants revisited. (Q1401299) (← links)
- Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials (Q1733314) (← links)
- Univariate real root isolation in an extension field and applications (Q1757003) (← links)
- On the complexity of the Lickteig-Roy subresultant algorithm (Q1757020) (← links)
- On solving univariate sparse polynomials in logarithmic time (Q1763426) (← links)
- Systems of rational polynomial equations have polynomial size approximate zeros on the average (Q1869964) (← links)
- Towards faster real algebraic numbers (Q1878487) (← links)
- A fast version of the Schur-Cohn algorithm. (Q1977142) (← links)
- Efficient sampling in spectrahedra and volume approximation (Q2144244) (← links)
- Subresultants of \((x-\alpha)^m\) and \((x-\beta)^n\), Jacobi polynomials and complexity (Q2188990) (← links)
- On the complexity of computing with planar algebraic curves (Q2254683) (← links)
- Real algebraic numbers and polynomial systems of small degree (Q2378492) (← links)
- Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study (Q2387419) (← links)
- Zero-nonzero and real-nonreal sign determination (Q2435509) (← links)
- Birational properties of the gap subresultant varieties (Q2456534) (← links)
- Fast computation of special resultants (Q2457312) (← links)
- Symmetric subresultants and applications (Q2470062) (← links)
- Exact, efficient, and complete arrangement computation for cubic curves (Q2507159) (← links)
- Parameterization of the discriminant set of a polynomial (Q2628787) (← links)
- \texttt{PTOPO}: computing the geometry and the topology of parametric curves (Q2674019) (← links)
- Block LU factorization of Hankel and Bezout matrices and Euclidean algorithm (Q3603591) (← links)
- D-resultant and subresultants (Q4671855) (← links)