Computing the measure of a polynomial

Authors:
L. Cerlienco;M. Mignotte;F. Piras
Affiliations:
Dipartimento di Matematica, Via Ospedale 72, 09100 Cagliari, Italy;Departement de Mathematique, Universite Louis Pasteur, 7 Rue Descartes, 67000 Strasbourg, France;-
Venue:
Journal of Symbolic Computation
Year:
1987

Citing 0
Cited 3

Inequalities about factors of integer polynomials

ACM SIGSAM Bulletin
Cost reduction on roots pre-isolation

AIKED'09 Proceedings of the 8th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases
Bounds on factors in Z[x]

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is concerned with the study of the measure of an univariate polynomial. We present a collection of known results of this quantity and propose some algorithms to compute it. These algorithms are either new or variants of known ones; some are algebraic, others are semi-numerical. In the course of this study we show (or recall) how linearly recursive sequences can be used in elimination problems. We also propose algorithms for computing the number of complex zeros of a polynomial which lie outside of the unit circle. The paper ends with examples and estimates of the cost of the algorithms.