On rational functions related to algorithms for a computation of roots
Part 2
DOI:
https://doi.org/10.5604/01.3001.0013.7275Słowa kluczowe:
iterative methods, Newton methods, rational functionsAbstrakt
We discuss a nice composition properties related to algorithms for computation of N-roots. Our approach gives direct proof that a version of Newton’s iterative algorithm is of order 2. A basic tool used in this note are properties of rational function 
, which was used earlier in [1] in the case of algorithms for computations of square roots.
Statystyka pobrań
Bibliografia
M. Baran, On rational functions related to algorithms for a computation of roots. I, (2019), submited to STI. Google Scholar
D. Braess, Nonlinear approximation theory, Springer Ser. Comput. Math. Springer, New York (1986). Google Scholar
E.S. Gawlik, Zolotariev iterations for the matrix square root, SIAM J. Matrix Anal. Appl. 40 (2) (2019), 696-719. Google Scholar
H. Rutishauser, Betrachtungen zur Quadratwurzeliteration, Monath. f. Math. 67 (1963) 452-464. Google Scholar
J.F. Traub, Iterative Methods for the Solution of Equations, Prentice-Hall, Englewood Cliffs, NJ (1983). Google Scholar
A.K. Yeyios, On two sequences of algorithms for approximating square roots, J. of Comp. Appl. Math. 40 (1992), 63-72. Google Scholar
Pobrania
Opublikowane
Jak cytować
Numer
Dział
Licencja
Prawa autorskie (c) 2019 Państwowa Wyższa Szkoła Zawodowa w Tarnowie & Autor
Utwór dostępny jest na licencji Creative Commons Uznanie autorstwa – Użycie niekomercyjne 4.0 Międzynarodowe.