𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Zeros of univariate interval polynomials

✍ Scribed by Xuchuan Fan; Jiansong Deng; Falai Chen

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
191 KB
Volume
216
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

✦ Synopsis

Polynomials with perturbed coefficients, which can be regarded as interval polynomials, are very common in the area of scientific computing due to floating point operations in a computer environment. In this paper, the zeros of interval polynomials are investigated. We show that, for a degree n interval polynomial, the number of interval zeros is at most n and the number of complex block zeros is exactly n if multiplicities are counted. The boundaries of complex block zeros on a complex plane are analyzed. Numeric algorithms to bound interval zeros and complex block zeros are presented.

πŸ“œ SIMILAR VOLUMES

A zero-free interval for chromatic polyn
A zero-free interval for chromatic polynomials
✍ D.R. Woodall πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 458 KB

Woodall, D.R., A zero-free interval for chromatic polynomials, Discrete Mathematics 101 (1992) 333-341. It is proved that, for a wide class of near-triangulations of the plane, the chromatic polynomial has no zeros between 2 and 2.5. Together with a previously known result, this shows that the zero

Zeros of polynomials
Zeros of polynomials
✍ A. Kharadze πŸ“‚ Article πŸ“… 1964 πŸ› Elsevier Science βš– 231 KB
Zeros of quaternion polynomials
Zeros of quaternion polynomials
✍ R. SerΓ΄dio; Lok-Shun Siu πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 147 KB

It is well known that, over a division ring, every zero of a polynomial f(x) = (:rxl) β€’.. (x -xn) is congruent to Xr for some r. In this note, we show further that, over the quaternion field, there exists at least one quaternion qr congruent to each x~, and that, through this result, a constructive

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