Affiliation:
1. Toho University, Miyama, Funabashi, Chiba, Japan
Abstract
The ISZ method (Interval-Symbol method with Zero rewriting) based on stabilization theory was proposed to reduce the amount of exact computations as much as possible but obtain the exact results by aid of floating-point computations. In this paper, we applied the ISZ method to Trager's algorithm which factors univariate polynomials over algebraic number fields. By Maple experiments, we show the efficiency of the ISZ method over the purely exact approach which uses exact computations throughout the execution of the algorithm. Furthermore, we propose a new method called the ISZ* method, which is similar to the ISZ method but beforehand excludes insufficient precisions of floating-point approximation by checking the correctness of the obtained supports. We confirmed that the ISZ* method is more effective than the ISZ method when the initially set precision is not sufficiently high.
Publisher
Association for Computing Machinery (ACM)
Subject
Microbiology (medical),Immunology,Immunology and Allergy
Reference11 articles.
1. G. Alefeld , J. Herzberger : Introduction to Interval Computation , Academic Press , 1983 . G. Alefeld, J. Herzberger : Introduction to Interval Computation, Academic Press, 1983.
2. Algorithms for Computer Algebra
3. E. Kaltofen : Factorization of polynomials . In Computer algebra , Springer , Vienna , 1983 , pp. 95 -- 113 . E. Kaltofen : Factorization of polynomials. In Computer algebra, Springer, Vienna, 1983, pp.95--113.
4. Effect of the Interval-Symbol Method with Correct Zero Rewriting on the Δ-LLL Algorithm;Nagashima H.;ACM Communications in Computer Algebra,2018
5. On Interval Methods with Zero Rewriting and Exact Geometric Computation;Schirra S.;LNCS,2017