𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Computational Complexity of Algebraic Numbers

✍ Scribed by H. T. Kung

Book ID
124920603
Publisher
Society for Industrial and Applied Mathematics
Year
1975
Tongue
English
Weight
578 KB
Volume
12
Category
Article
ISSN
0036-1429

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Computing in the Field of Complex Algebr
Computing in the Field of Complex Algebraic Numbers
✍ ADAM WOJCIECH STRZEBOΕƒSKI πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 371 KB

In this paper we present two methods of computing with complex algebraic numbers. The first uses isolating rectangles to distinguish between the roots of the minimal polynomial, the second method uses validated numeric approximations. We present algorithms for arithmetic and for solving polynomial e

Algebraic computation of the number of z
Algebraic computation of the number of zeros of a complex polynomial in the open unit disk by a polynomial representation
✍ B. Gleyse; A. Larabi; M. Moflih πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 224 KB

We present a general method for the exact computation of the number of zeros of a complex polynomial inside the unit disk, assuming that the polynomial does not vanish on the unit circle. We prove the existence of a polynomial sequence. This sequence involves a reduced number of arithmetic operation