Title: The Brahmagupta algorithm for square rooting
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 ...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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>Read More
Publication Year: 2003
Publication Date: 2003-01-07
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 1
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot