Cauchy index computation

Calcolo

Volumn 33, Issue 1-4, 1996, Pages 336-351

  Lickteig, Thomas ^a   Roy, Marie Françoise ^b  

^a UNIVERSITY OF BONN   (Germany)

^b UNIVERSITÉ DE RENNES 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; MATRIX ALGEBRA; TURING MACHINES;

BIT COMPLEXITY; BIT SIZE; CAUCHY INDEX; EUCLIDEAN; HANKEL MATRIX; INDEX COMPUTATION; RATIONAL FRACTION; REAL ALGEBRAIC GEOMETRY; REAL ROOT COUNTING; ROUTH-HURWITZ;

POLYNOMIALS;

EID: 0029704143     PISSN: 00080624     EISSN: None     Source Type: Journal    
DOI: 10.1007/bf02576008     Document Type: Article

References (21)

1. L. DUCOS, Algorithme de Bareiss, algorithmes des sous-résultants, Prépublication, Unversité de Poitiers.
2. F. R. GANTMACHER, Théorie des matrices, tome I, Dunod 1966 and Springer-Verlag 1986.
3. L. GEMIGNANI, Computing the inertia of Bézout and Hankel matrices, CALCOLO 28, (1991) 267-274.
4. L. GONZALEZ, H. LOMBARDI, T. RECIO, M.-F. ROY, Spécialisation de la suite de Sturm et sous-résultants I, Informatique théorique et applications 24, (1990) 561-588.
5. L. GONZALEZ, H. LOMBARDI, T. RECIO, M.-F. ROY, Spécialisation de la suite de Sturm, Informatique théorique et applications 28, (1994) 1-24.
6. L. GONZALEZ, H. LOMBARDI, T. RECIO, M.-F. ROY, Sturm- Habicht sequence, determinants and real roots of univariate polynomials, Quantifier Elimination and Cylindrical Algebraic Decomposition, Texts and Monographs in Symbolic Computation, B. Caviness and J. Johnson, Eds. Springer-Verlag Wien, New York 1994, to appear.
7. W. HABICHT, Eine Verallgemeinerung des Sturmschen Wurzelzählverfahrens, Comm. Math. Helvetici 21, (1948) 99-116.
8. P. HENRICI, Applied and computational complex analysis, vol. 1, J. Wiley, New York 1974.
9. M. KNEBUSCH AND C. SCHEIDERER, Einführung in die reelle Algebra, Vieweg-Studium 63, Aufbaukurs Mathematik, Vieweg, 1989.
10. H. T. KUNG, On computing reciprocals of power series, Numer. Math. 22, (1974) 341-348.
11. D. LAZARD, Sous-résultants, Manuscrit non publié.
12. R. LOOS, Generalized polynomial remainder sequences, in: Computer algebra, symbolic and algebraic computation, Springer-Verlag, Berlin, 1982.
13. R. T. MOENCK, Fast computation of GCDs, Proc. STOC'73, (1973) 142-151.
14. C. QUITTÉ, Une démonstration de l'algorithme de Bareiss par l'algèbre extérieure, Manuscrit non publié.
15. M.-F. ROY, Basic algorithms in real algebraic geometry and their complexity: from Sturm's theorem to the existential theory of reals, Lectures on Real Geometry in memoriam of Mario Raimondo, de Gruyter Expositions in Mathematics (1996) to appear.
16. A. SCHÖNHAGE, Schnelle Berechnung von Kettenbruchentwicklungen, Acta Informatica 1, (1971) 139-144.
17. A. SCHÖNHAGE, Asymptotical fast algorithms for the numerical multiplication and division of polynomials with complex coefficients, in: Proceedings, EUROCAM'82, Marseille, 1982.
18. A. SCHÖNHAGE, The fundamental theorem of algebra in terms of computational complexity, preliminary report, Universität Tübingen, 1982.
19. A. SCHÖNHAGE AND V. STRASSEN, Schnelle Multiplikation grosser Zahlen, Computing 7, (1971) 281-292.
20. M. SIEVEKING, An algorithm for division of power series, Computing 10, (1972) 153-156.
21. V. STRASSEN, The Computational Complexity of Continued Fractions, SIAM J. Comp. 12/1, (1983) 1-27.