Computing multiple roots of inexact polynomials
نویسندگان
چکیده
منابع مشابه
Computing multiple roots of inexact polynomials
We present a combination of two novel algorithms that accurately calculate multiple roots of general polynomials. For a given multiplicity structure and initial root estimates, Algorithm I transforms the singular root-finding into a regular nonlinear least squares problem on a pejorative manifold, and calculates multiple roots simultaneously. To fulfill the input requirement of Algorithm I, we ...
متن کاملThe computation of multiple roots of polynomials whose coefficients are inexact
This lecture will show by example some of the problems that occur when the roots of a polynomial are computed using a standard polynomial root solver. In particular, polynomials of high degree with a large number of multiple roots will be considered, and it will be shown that even roundoff error due to floating point arithmetic, in the absence of data errors, is sufficient to cause totally inco...
متن کاملEfficiently Computing Real Roots of Sparse Polynomials
We propose an efficient algorithm to compute the real roots of a sparse polynomial f ∈ R[x] having k non-zero realvalued coefficients. It is assumed that arbitrarily good approximations of the non-zero coefficients are given by means of a coefficient oracle. For a given positive integer L, our algorithm returns disjoint disks ∆1, . . . ,∆s ⊂ C, with s < 2k, centered at the real axis and of radi...
متن کاملComputing real roots of real polynomials
Computing the roots of a univariate polynomial is a fundamental and long-studied problem of computational algebra with applications in mathematics, engineering, computer science, and the natural sciences. For isolating as well as for approximating all complex roots, the best algorithm known is based on an almost optimal method for approximate polynomial factorization, introduced by Pan in 2002....
متن کاملComputing roots of polynomials by quadratic clipping
We present an algorithm which is able to compute all roots of a given univariate polynomial within a given interval. In each step, we use degree reduction to generate a strip bounded by two quadratic polynomials which encloses the graph of the polynomial within the interval of interest. The new interval(s) containing the root(s) is (are) obtained by intersecting this strip with the abscissa axi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2004
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-04-01692-8