A note on machine method for root extraction

  • Saroj Kumar Padhan Veer Surendra Sai University of Technology Burla
  • S. Gadtia Veer Surendra Sai University of Technology
DOI: https://doi.org/10.5269/bspm.42530

Abstract

The present investigation deals with the critical study of the works of Lancaster and Traub, who have developed $n$th root extraction methods of a real number. It is found that their developed methods are equivalent and the particular cases of Halley's and Householder's methods. Again the methods presented by them are easily obtained from simple modifications of Newton's method, which is the extension of Heron's square root iteration formula. Further, the rate of convergency of their reported methods are studied.

Downloads

Download data is not yet available.

Author Biography

Saroj Kumar Padhan, Veer Surendra Sai University of Technology Burla

I received my Ph.D. degree from Indian Institute of Technology Kharagpur in 2011. After that I am working as an assistant professor at Veer Surendra Sai University of Technology Burla from 11.08.2011 to till date. My area of research are applied mathematics and optimization, fractional calculus, number theory. I have published my research papers in many reputed journal like Computer and Mathemartics with Applications, Applied Mathematics and Computations, Nonlinear Analysis: Hybrid Systems, Mathematical Methods in Applied Sciences, Journal Applied Mathematics and Computing etc

References

M. S. Bahgat, M. A. Hafiz, Three-step iterative method with 18th order convergence for solving nonlinear equations. Int. J. Pure Appl. Math. 93, 85-94, (2014). https://doi.org/10.12732/ijpam.v93i1.7

Burton, D.M., History of Mathematics. An Introduction , McGraw Hill, 3rd ed., (1923).

W. Gander, On Halley's iteration method. Amer. Math. Monthly 92, 131-134, (1985). https://doi.org/10.1080/00029890.1985.11971554

M. A. Hafiz, Solving nonlinear equations using steffensen-type methods with optimal order of convergence. Palesteine J. Math. 3, 113-119, (2014).

M. A. Hernandez, N. Romero, Letter to the editor, Accelerated convergence in Newton's method for approximating square roots. J. Comput. Appl. Math. 177, 225-229, (2005). https://doi.org/10.1016/j.cam.2004.09.025

R. J. Knill, A modified Babylonian algorithm. Amer. Math.Monthly 99, 734-737, (1992). https://doi.org/10.1080/00029890.1992.11995920

O. E. Lancaster, Machine method for the extraction of cube root. Journal of American Statistical Association 37, 112-115, (1942). https://doi.org/10.1080/01621459.1942.10500620

K. I. Noor, M. A. Noor, S. Momani, Modified Householder iterative method for nonlinear equations. Appl. Math. Comput. 190, 1534-1539, (2007). https://doi.org/10.1016/j.amc.2007.02.036

T. J. Osler, Extending the Babylonian Algorithm. Math. Comput. Education 33, 120-128, (1999).

S. K. Padhan, S. Gadtia, B. Bhoi, FPGA based implementation for extracting the roots of real number. Alexandria Engineering Journal 55, 2849-2854, (2016). https://doi.org/10.1016/j.aej.2016.07.003

S. K. Padhan, S. Gadtia and A. K. Pattanaik, Remarks on Heron's cubic root iteration formula. Bol. Soc. Parana. Mat. 35, 173-180, (2017). https://doi.org/10.5269/bspm.v35i3.28629

J. F. Traub, Comparison of iterative methods for the calculation of nth roots. Communications of the ACM 4, 143-145, (1961). https://doi.org/10.1145/366199.366252

H. S. Wall, A modification of Newton's method. Amer. Math. Monthl 55, 90-95, (1948). https://doi.org/10.2307/2305743

Published
2021-12-16
Issue
Vol 40 (2022)
Section
Articles

Copyright (c) 2021 Boletim da Sociedade Paranaense de Matemática

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

When the manuscript is accepted for publication, the authors agree automatically to transfer the copyright to the (SPM).

The journal utilize the Creative Common Attribution (CC-BY 4.0).

 

Funding data

Crossref
Scopus
Google Scholar
Europe PMC