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
β¦ LIBER β¦
Computing with complex algebraic numbers. JSC 1997
β Scribed by Strzebonski.
- Book ID
- 127399562
- Tongue
- English
- Weight
- 74 KB
- Category
- Library
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Computing in the Field of Complex Algebr
β
ADAM WOJCIECH STRZEBOΕSKI
π
Article
π
1997
π
Elsevier Science
π
English
β 371 KB
The Computational Complexity of Algebrai
β
Kung, H. T.
π
Article
π
1975
π
Society for Industrial and Applied Mathematics
π
English
β 697 KB
The Computational Complexity of Algebrai
β
H. T. Kung
π
Article
π
1975
π
Society for Industrial and Applied Mathematics
π
English
β 578 KB
Complexity of computation on real algebr
β
Marie-FranΓ§oise Royβ ; Aviva Szpirglasβ‘
π
Article
π
1990
π
Elsevier Science
π
English
β 670 KB
Complexity of Computer Computations || E
β
Miller, Raymond E.; Thatcher, James W.; Bohlinger, Jean D.
π
Article
π
1972
π
Springer US
π
English
β 965 KB
The Symposium On The Complexity Of Computer Compu Tations Was Held At The Ibm Thomas J. Watson Research Center In Yorktown Heights, New York, March 20-22, 1972. These Proceedings Contain All Papers Presented At The Symposium Together With A Transcript Of The Concluding Panel Discussion And A Compreh
Lazy computation with exact real numbers
β
Edalat et al.
π
Library
π
English
β 69 KB