𝔖 Bobbio Scriptorium
✦   LIBER   ✦

High order iterative methods for approximating square roots

✍ Scribed by B. Kalantari; I. Kalantari

Publisher
Springer Netherlands
Year
1996
Tongue
English
Weight
210 KB
Volume
36
Category
Article
ISSN
0006-3835

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Calculus of nth roots and third order it
Calculus of nth roots and third order iterative methods
✍ J.M. GutiΓ©rrez; M.A. HernΓ‘ndez; M.A. Salanova πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 187 KB

We apply a family of iterative methods to the problem of extracting the \(n\)th root of a positive number \(R\), that is, to solve the nonlinear equation \(t^{n}-R=0\). For each value of \(n\) we obtain the method in the family for which the highest order of convergence is reached.

A uniparametric family of three-step eig
A uniparametric family of three-step eighth-order multipoint iterative methods for simple roots
✍ Young Hee Geum; Young Ik Kim πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 245 KB

A uniparametric family of three-step eighth-order multipoint iterative methods requiring only a first derivative are proposed in this paper to find simple roots of nonlinear equations. Development and convergence analysis on the proposed methods is described along with numerical experiments includin

A tight bound for approximating the squa
A tight bound for approximating the square root
✍ Nader H. Bshouty; Yishay Mansour; Baruch Schieber; Prasoon Tiwari πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 285 KB

We prove an R (log log( l/c) ) lower bound on the depth of any computation tree and any RAM program with operations {+, -, \*, /, [.j, not, and, br, xor}, unlimited power of answering YES/NO questions, and constants (0.1) that computes 4 to accuracy E, for all x E [ 1,2]. Since the Newton method ach