Title :
The Brahmagupta algorithm for square rooting
Author :
Kak, S.C. ; Barb, A.O.
Author_Institution :
Dept. of Electr. & Comput. Eng., Louisiana State Univ., Baton Rouge, LA, USA
Abstract :
An algorithm for square root evaluation is introduced. Novel features of the algorithm include suitability for parallel processing and multi-initial guesses of the root. An extension of the algorithm to the nth rooting is provided. A VLSI hardware architecture is developed for implementing the two-initial-guesses version of the algorithm. Comparison with existing techniques proves that the well known Newton´s method is a special case of this algorithm. Convergence properties are also established
Keywords :
convergence of numerical methods; mathematics computing; parallel algorithms; Brahmagupta algorithm; VLSI; convergence; hardware architecture; mathematics computing; multiple initial guesses; parallel processing; square rooting; Application software; Astronomy; Computer architecture; Equations; Hardware; Iterative algorithms; Iterative methods; Mathematics; Parallel processing; Very large scale integration;
Conference_Titel :
System Theory, 1989. Proceedings., Twenty-First Southeastern Symposium on
Conference_Location :
Tallahassee, FL
Print_ISBN :
0-8186-1933-3
DOI :
10.1109/SSST.1989.72510
