Cauchy index computation
From MaRDI portal
Publication:1127957
DOI10.1007/BF02576008zbMath0904.65024OpenAlexW2043648393MaRDI QIDQ1127957
Thomas Lickteig, Marie-Françoise Roy
Publication date: 10 August 1998
Published in: Calcolo (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02576008
complexityalgorithmCauchy indexalgebraic geometryRouth-Hurwitz problemrational fractionexact sign determinationmultitape Turing machine modelreal root countingsignature of a Hankel matrix
Approximation by rational functions (41A20) Computation of special functions and constants, construction of tables (65D20)
Related Items (13)
Polynomial equation solving by lifting procedures for ramified fibers ⋮ A hybrid approach to the computation of the inertia of a parametric family of Bézoutians with application to some stability problems for bivariate polynomials ⋮ An elementary approach to subresultants theory. ⋮ Birational properties of the gap subresultant varieties ⋮ Fast computation of special resultants ⋮ Quantitative fundamental theorem of algebra ⋮ A fast version of the Schur-Cohn algorithm. ⋮ Symmetric subresultants and applications ⋮ On the complexity of the Lickteig-Roy subresultant algorithm ⋮ Sylvester-Habicht sequences and fast Cauchy index computation ⋮ A Gröbner free alternative for polynomial system solving ⋮ Exact, efficient, and complete arrangement computation for cubic curves ⋮ New structure theorem for subresultants
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing the inertia of Bézout and Hankel matrices
- 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
- Fast computation of GCDs
This page was built for publication: Cauchy index computation
