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

fYear

1989

fDate

26-28 Mar 1989

Firstpage

456

Lastpage

459

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;

fLanguage

English

Publisher

ieee

Conference_Titel

System Theory, 1989. Proceedings., Twenty-First Southeastern Symposium on

Conference_Location

Tallahassee, FL

ISSN

0094-2898

Print_ISBN

0-8186-1933-3

Type

conf

DOI

10.1109/SSST.1989.72510

Filename

72510

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2176204