Computing sharp and scalable bounds on errors in approximate zeros of univariate polynomials
暂无分享,去创建一个
There are several numerical methods for computing approximate zeros of a given univariate polynomial. In this paper, we develop a simple and novel method for determining sharp upper bounds on errors in approximate zeros of a given polynomial using Rouche's theorem from complex analysis. We compute the error bounds using non-linear optimization. Our bounds are scalable in the sense that we compute sharper error bounds for better approximations of zeros. We use high precision computations using the LEDA/real floating-point filter for computing our bounds robustly.
[1] Victor Y. Pan,et al. Approximating Complex Polynomial Zeros: Modified Weyl's Quadtree Construction and Improved Newton's Iteration , 2000, J. Complex..
[2] Brian T. Smith,et al. Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems , 1970, JACM.
[3] S. Smale. The fundamental theorem of algebra and complexity theory , 1981 .
[4] M. A. Jenkins,et al. Algorithm 419: zeros of a complex polynomial [C2] , 1972, CACM.