𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computing in the Field of Complex Algebraic Numbers

✍ Scribed by ADAM WOJCIECH STRZEBOŃSKI

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
371 KB
Volume
24
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

✦ Synopsis

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 equations, and compare implementations of both methods in Mathematica.

📜 SIMILAR VOLUMES

On the Units of Algebraic Number Fields
On the Units of Algebraic Number Fields
✍ I. Yamaguchi; H. Takeuchi 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 99 KB

Let \(K\) be an algebraic number field and \(k\) be a proper subfield of \(K\). Then we have the relations between the relative degree \([K: k]\) and the increase of the rank of the unit groups. Especially, in the case of \(m\) th cyclotomic field \(Q\left(\zeta_{m}\right)\), we determine the number

Gröbner Bases in Orders of Algebraic Num
Gröbner Bases in Orders of Algebraic Number Fields
✍ David Andrew Smith 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 281 KB

We prove that any order O of any algebraic number field K is a reduction ring. Rather than showing the axioms for a reduction ring hold, we start from scratch by well-ordering O, defining a division algorithm, and demonstrating how to use it in a Buchberger algorithm which computes a Gröbner basis g