Computer Science – Symbolic Computation
Scientific paper
2011-02-23
Computer Science
Symbolic Computation
19 pages,2 figures; MM-Preprint of KLMM, Vol. 29, 92-111, Aug. 2010
Scientific paper
In this paper, a linear univariate representation for the roots of a zero-dimensional polynomial equation system is presented, where the roots of the equation system are represented as linear combinations of roots of several univariate polynomial equations. The main advantage of this representation is that the precision of the roots can be easily controlled. In fact, based on the linear univariate representation, we can give the exact precisions needed for roots of the univariate equations in order to obtain the roots of the equation system to a given precision. As a consequence, a root isolation algorithm for a zero-dimensional polynomial equation system can be easily derived from its linear univariate representation.
Cheng Jin-San
Gao Xiao-Shan
Guo Leilei
No associations
LandOfFree
Root Isolation of Zero-dimensional Polynomial Systems with Linear Univariate Representation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Root Isolation of Zero-dimensional Polynomial Systems with Linear Univariate Representation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Root Isolation of Zero-dimensional Polynomial Systems with Linear Univariate Representation will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-174349