On rational functions related to algorithms for a computation of roots

Part 2

Authors

DOI:

https://doi.org/10.5604/01.3001.0013.7275

Keywords:

iterative methods, Newton methods, rational functions

Abstract

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.

Downloads

Download data is not yet available.

References

M. Baran, On rational functions related to algorithms for a computation of roots. I, (2019), submited to STI.

D. Braess, Nonlinear approximation theory, Springer Ser. Comput. Math. Springer, New York (1986).

E.S. Gawlik, Zolotariev iterations for the matrix square root, SIAM J. Matrix Anal. Appl. 40 (2) (2019), 696-719.

H. Rutishauser, Betrachtungen zur Quadratwurzeliteration, Monath. f. Math. 67 (1963) 452-464.

J.F. Traub, Iterative Methods for the Solution of Equations, Prentice-Hall, Englewood Cliffs, NJ (1983).

A.K. Yeyios, On two sequences of algorithms for approximating square roots, J. of Comp. Appl. Math. 40 (1992), 63-72.

Downloads

Published

2019-12-31

Issue

Section

Original articles

How to Cite

Baran, M. (2019). On rational functions related to algorithms for a computation of roots: Part 2. Science, Technology and Innovation, 7(4), 26-29. https://doi.org/10.5604/01.3001.0013.7275

Most read articles by the same author(s)