A new and novel method for computing an upper bound on the distance of an approximate zero from an exact zero of a univariate polynomial

Authors: S. Brahma; P. H. D. Ramakrishna; S. Prasant Pal

Source: International Journal of Computer Mathematics, Volume 81, Number 12, December 2004 , pp. 1549-1557(9)

Publisher: Taylor and Francis Ltd

Key:

- Free Content

- New Content

- Subscribed Content

- Free Trial Content

Abstract:

In this paper, we develop a simple and novel method for determining a sharp upper bound on the distance of a given approximate zero from an exact zero of a univariate polynomial. The computed bounds are scalable in the sense that we can compute sharper error bounds for better given approximations of zeros. We analyse the convergence of our method. We use requisite high precision computations for computing our bounds correctly and robustly.

Keywords: Error Bounds; Rouche's Theorem; A Posteriori Error Analysis; Approximate Zeros; High Precision Computation

Document Type: Research article

DOI: 10.1080/0020716042000272511

The full text electronic article is available for purchase. You will be able to download the full text electronic article after payment.

$45.29 plus tax Refund Policy