WAYS OF SEPARATION OF ROOTS AND METHODS OF DIVIDING INTERMEDIATE
Main Article Content
Abstract
Finding the roots of a zero-dimensional polynomial system is a fundamental problem with a wide range of applications, including algebraic geometry, computer graphics, and computer-aided geometric design. The development of robust and validated algorithms in particular and efficient methods for determining isolating zones for all roots of polynomial systems are required.This article discusses about ways of separation of roots and metgods of dividing intermediate.
Article Details
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
References
Algebraic Planar Curves. Computer Aided Geometric Design, 25(8):631–651, 2008.
G. Alefeld and J. Herzberger. Introduction to Interval Computations. Computer Science and Applied Mathematics. New York: Academic Press Inc., 1983.
S. Basu, R. Pollack, and M.-F. Roy. Algorithms in Real Algebraic Geometry, volume 10 of Algorithms and Computation in Mathematics. Springer, 2nd edition, 2006.
H. Bronnimann, I. Z. Emiris, V. Y. Pan, and S. Pion. Computing exac ¨ t geometric predicates using modular arithmetic with single precision. In SCG ’97: Proc. of the 13th Ann. Symp. onComputational Geometry, pages 174–182. ACM press, 1997.
W. D. Brownawell and Chee K. Yap. Lower bounds for zero-dimensional projections. In Proc. Int’l Symp. Symbolic and Algebraic Comp. (ISSAC’09), page To appear, 2009. KIAS,Seoul, Korea, Jul 28-31, 2007. DOI: http://doi.acm.org/10.1145/1277548.1277562. In press, Journal of Symbolic Computation.
M. Burr, S.W. Choi, B. Galehouse, and C. Yap. Complete subdivision algorithms, II: Isotopic meshing of singular algebraic curves. In Proc. Int’l Symp. Symbolic and Algebraic Computation (ISSAC’08), pages 87–94, 2008. Hagenberg, Austria. Jul 20-23, 2008.