Two square root algorithms utilizing multiplication as the iterative operator
James R. Goodman · NASA STI Repository (National Aeronautics and Space Administration)
The hardware algorithms are presented which utilize high-speed multiplication and no division to perform the square root operation rapidly.One algorithm is intended for a large general-purpose computer and in addition pro vides a second-order division scheme.The second al gorithm requires a-special function generator which is presently utilized in certain existing computers.Each algorithm is considered for convergence rate, variance, accuracy and implementation.The effect and importance of the initial approximation is considered.A simulation is performed to compare each to a conventional algorithm.Although both algorithms are intended strictly for hard ware implementation, either may find an application using microprogramming, and under certain conditions, one might be implemented in software.