arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv cs/0306015math.NAcs.NA
收藏

计算单变量多项式近似零点误差的尖锐且可扩展的界

Computing sharp and scalable bounds on errors in approximate zeros of univariate polynomials

P. H. D. Ramakrishna, Sudebkumar Prasant Pal, Samir Bhalla, Hironmay Basu, Sudhir Kumar Singh

AI总结:

本文利用儒歇定理和非线性优化,提出一种计算单变量多项式近似零点误差尖锐上界的新方法,并采用高精度计算确保稳健性。

摘要:

针对给定单变量多项式近似零点的计算,已有多种数值方法。本文利用复分析中的儒歇定理,提出一种简单新颖的方法来确定给定多项式近似零点误差的尖锐上界。我们通过非线性优化计算误差界。我们的界具有可扩展性,即对于更好的零点近似,我们能计算出更尖锐的误差界。我们使用LEDA/real浮点过滤器进行高精度计算,以稳健地计算我们的界。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑