Efficient iterative methods for finding simultaneously all the multiple roots of polynomial equation
Abstract Two new iterative methods for the simultaneous determination of all multiple as well as distinct roots of nonlinear polynomial equation are established, using two suitable corrections to achieve a very high computational efficiency as compared to the existing methods in the literature. Conv...
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2021-11-01
|
| Series: | Advances in Difference Equations |
| Subjects: | |
| Online Access: | https://doi.org/10.1186/s13662-021-03649-6 |
| Summary: | Abstract Two new iterative methods for the simultaneous determination of all multiple as well as distinct roots of nonlinear polynomial equation are established, using two suitable corrections to achieve a very high computational efficiency as compared to the existing methods in the literature. Convergence analysis shows that the orders of convergence of the newly constructed simultaneous methods are 10 and 12. At the end, numerical test examples are given to check the efficiency and numerical performance of these simultaneous methods. |
|---|---|
| ISSN: | 1687-1847 |