Sylvester-Habicht sequences and fast Cauchy index computation
From MaRDI portal
Publication:5929709
DOI10.1006/jsco.2000.0427zbMath0976.65043OpenAlexW2006311046MaRDI QIDQ5929709
Marie-Françoise Roy, Thomas Lickteig
Publication date: 2 July 2001
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.2000.0427
algorithmssignatureCauchy indexHankel matrixrational functionsub-resultant theoremSylvester-Habicht polynomials
Related Items
Continuous amortization and extensions: with applications to bisection-based root isolation, Towards faster real algebraic numbers, Parameterization of the discriminant set of a polynomial, Automatic computation of the complete root classification for a parametric polynomial, Real algebraic numbers and polynomial systems of small degree, Efficient sampling in spectrahedra and volume approximation, Solving bivariate systems using rational univariate representations, Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study, \texttt{PTOPO}: computing the geometry and the topology of parametric curves, Subresultants of \((x-\alpha)^m\) and \((x-\beta)^n\), Jacobi polynomials and complexity, An elementary approach to subresultants theory., Subresultants revisited., On the topology of real algebraic plane curves, Zero-nonzero and real-nonreal sign determination, A general approach to isolating roots of a bitstream polynomial, SqFreeEVAL: An (almost) optimal real-root isolation algorithm, Separating linear forms and rational univariate representations of bivariate systems, Birational properties of the gap subresultant varieties, Fast computation of special resultants, Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials, A fast version of the Schur-Cohn algorithm., Symmetric subresultants and applications, Bivariate triangular decompositions in the presence of asymptotes, Univariate real root isolation in an extension field and applications, On the complexity of the Lickteig-Roy subresultant algorithm, On the complexity of computing with planar algebraic curves, On solving univariate sparse polynomials in logarithmic time, D-resultant and subresultants, A parametric representation of totally mixed Nash equilibria, Block LU factorization of Hankel and Bezout matrices and Euclidean algorithm, Exact, efficient, and complete arrangement computation for cubic curves, On the asymptotic and practical complexity of solving bivariate systems over the reals, Systems of rational polynomial equations have polynomial size approximate zeros on the average
Cites Work
- Cauchy index computation
- Computing the inertia of Bézout and Hankel matrices
- Solving Hankel systems over the integers
- The Habicht approach to subresultants
- On computing reciprocals of power series
- Fast multiplication of large numbers
- Fast computation of continued fraction expansions.
- An algorithm for division of powerseries
- Eine Verallgemeinerung des Sturmschen Wurzelzählverfahrens
- Algorithme de Bareiss, algorithme des sous-résultants
- The Computational Complexity of Continued Fractions
- Spécialisation de la suite de Sturm et sous-résultants (I)
- The method of symmetric and Hermitian forms in the theory of the separation of the roots of algebraic equations
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- Fast computation of GCDs
- Spécialisation de la suite de Sturm
- Subresultants and Reduced Polynomial Remainder Sequences
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
- On Euclid's Algorithm and the Theory of Subresultants
- Upper Bounds for the Abscissa of Stability of a Stable Polynomial
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
