Advertisement
Published in:
2007 | OriginalPaper | Chapter
An Algebraic Method for Separating Close-Root Clusters and the Minimum Root Separation
Authors : Tateaki Sasaki, Fujio Kako
Published in: Symbolic-Numeric Computation
Publisher: Birkhäuser Basel
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Given a univariate polynomial over
C
, we discuss two issues, an algebraic method for separating a factor of mutually close roots from the polynomial, and a reasonable formula for the minimum root separation, by assuming that the close roots form well-separated clusters. The technique we use is very simple and effective; we move the origin near to the center of a close-root cluster, and then we are able to treat the other roots collectively, reducing the problem to a very simple one. Following this idea, we present a very simple and stable algebraic method for separating the close-root cluster, derive two lower-bound formulas for the distance between two close roots, and obtain a fairly simple lower bound of the minimum root separation of polynomials over
C
.