๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Finding a Cluster of Zeros of Univariate Polynomials

โœ Scribed by Jean-Claude Yakoubsohn

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
305 KB
Volume
16
Category
Article
ISSN
0885-064X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Detection and Validation of Clusters of
Detection and Validation of Clusters of Polynomial Zeros
โœ V. HRIBERNIG; H.J. STETTER ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 385 KB

We consider the task of partitioning the zeros of a real or complex polynomial into clusters and of determining their location and multiplicity for polynomials with coefficients of limited accuracy. We derive computational procedures for the solution of this task which combine symbolic computation w

On Approximate GCDs of Univariate Polyno
On Approximate GCDs of Univariate Polynomials
โœ N.K. Karmarkar; Y.N. Lakshman ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 403 KB

In this paper, we consider computations involving polynomials with inexact coefficients, i.e. with bounded coefficient errors. The presence of input errors changes the nature of questions traditionally asked in computer algebra. For instance, given two polynomials, instead of trying to compute their

Zeros of Certain Sums of Two Polynomials
Zeros of Certain Sums of Two Polynomials
โœ Seon-Hong Kim ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 103 KB

In this paper, we investigate the zero distribution of various sums of polynomials of the form A + B or A + tB 0 < t < โˆž or -โˆž < t < โˆž , especially for A and B monic polynomials of the same degree. More precisely, we study generalizations and analogues of x -1 n + x + 1 n and their factorizations.