Computing sharp and scalable bounds on errors in approximate zeros of univariate polynomials
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2003
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866914099052412928 |
|---|---|
| author | Ramakrishna, P. H. D. Pal, Sudebkumar Prasant Bhalla, Samir Basu, Hironmay Singh, Sudhir Kumar |
| author_facet | Ramakrishna, P. H. D. Pal, Sudebkumar Prasant Bhalla, Samir Basu, Hironmay Singh, Sudhir Kumar |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_cs_0306015 |
| institution | arXiv |
| publishDate | 2003 |
| record_format | arxiv |
| spellingShingle | Computing sharp and scalable bounds on errors in approximate zeros of univariate polynomials Ramakrishna, P. H. D. Pal, Sudebkumar Prasant Bhalla, Samir Basu, Hironmay Singh, Sudhir Kumar Numerical Analysis F.2.1, G.1.0, G.1.5 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. |
| title | Computing sharp and scalable bounds on errors in approximate zeros of univariate polynomials |
| topic | Numerical Analysis F.2.1, G.1.0, G.1.5 |
| url | https://arxiv.org/abs/cs/0306015 |