A New Initial Approximation Bound in the Durand Kerner Algorithm for Finding Polynomial Zeros
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911259008434176 |
|---|---|
| author | Sanjoyo, B. A. Yunus, M. Hidayat, N. |
| author_facet | Sanjoyo, B. A. Yunus, M. Hidayat, N. |
| contents | The Durand-Kerner algorithm is a widely used iterative technique for simultaneously finding all the roots of a polynomial. However, its convergence heavily depends on the choice of initial approximations. This paper introduces two novel approaches for determining the initial values: New bound 1 and the lambda maximal bound, aimed at improving the stability and convergence speed of the algorithm. Theoretical analysis and numerical experiments were conducted to evaluate the effectiveness of these bounds. The lambda maximal bound consistently ensures that all the roots lie within the complex circle, leading to faster and more stable convergence. Comparative results demonstrate that while New bound 1 guarantees convergence, but it yields excessively large radii. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_07728 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A New Initial Approximation Bound in the Durand Kerner Algorithm for Finding Polynomial Zeros Sanjoyo, B. A. Yunus, M. Hidayat, N. Numerical Analysis Data Structures and Algorithms Mathematical Software The Durand-Kerner algorithm is a widely used iterative technique for simultaneously finding all the roots of a polynomial. However, its convergence heavily depends on the choice of initial approximations. This paper introduces two novel approaches for determining the initial values: New bound 1 and the lambda maximal bound, aimed at improving the stability and convergence speed of the algorithm. Theoretical analysis and numerical experiments were conducted to evaluate the effectiveness of these bounds. The lambda maximal bound consistently ensures that all the roots lie within the complex circle, leading to faster and more stable convergence. Comparative results demonstrate that while New bound 1 guarantees convergence, but it yields excessively large radii. |
| title | A New Initial Approximation Bound in the Durand Kerner Algorithm for Finding Polynomial Zeros |
| topic | Numerical Analysis Data Structures and Algorithms Mathematical Software |
| url | https://arxiv.org/abs/2511.07728 |