A family of polynomials that defy general convergence in three methods
We consider the root-finding algorithms of Newton’s method, Halley’s method and Schröder’s method. These methods are known to have polynomials for which the method produces extraneous attracting cycles, i.e. the method is not generally convergent for these polynomials. We produce a family of polynom...
Gorde:
| Egile Nagusiak: | , |
|---|---|
| Formatua: | Artigo |
| Hizkuntza: | Inglês |
| Argitaratua: |
Elsevier
2025-12-01
|
| Saila: | Examples and Counterexamples |
| Gaiak: | |
| Sarrera elektronikoa: | http://www.sciencedirect.com/science/article/pii/S2666657X25000187 |
| Etiketak: |
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|