𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complexity of computation on real algebraic numbers

✍ Scribed by Marie-Françoise Roy†; Aviva Szpirglas‡

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
670 KB
Volume
10
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On approximation of real numbers by alge
On approximation of real numbers by algebraic numbers of bounded degree
✍ Kiryl I. Tsishchanka 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 228 KB

Dirichlet proved that for any real irrational number ξ there exist infinitely many rational numbers p/q such that |ξp/q| < q -2 . The correct generalization to the case of approximation by algebraic numbers of degree n, n > 2, is still unknown. Here we prove a result which improves all previous esti

Virtual Betti numbers of real algebraic
Virtual Betti numbers of real algebraic varieties
✍ Clint McCrory; Adam Parusiński 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 105 KB

We show that for all i 0 the i-th mod 2 Betti number of compact nonsingular real algebraic varieties has a unique extension to a virtual Betti number β i defined for all real algebraic varieties, such that if Y is a closed subvariety of X then β i (X) = β i (X \ Y ) + β i (Y ). We show by example th

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