Algorithms to calculate square root
- To: mathgroup at smc.vnet.net
- Subject: [mg16454] Algorithms to calculate square root
- From: "Ajith" <ajith.pn at pcm.bosch.de>
- Date: Sat, 13 Mar 1999 02:21:57 -0500
- Organization: The Bosch Group (Robert Bosch GmbH, Germany)
- Sender: owner-wri-mathgroup at wolfram.com
Hi This question is about the calculation of square root using numerical analytical algorithms. I found the formula (from the book "Numerical Recipes in C - The Art of Scientific Computing" ) if U[i+1] = 0.5 * U[i] * ( 3 - V * U[i] * U[i] ) then U[infinity] converges quadratically to 1/sqrt(V). A final multiplication by V gives sqrt(V). Are there any other similar algorithm to calculate square root? Thanks in advance for help. Regards Ajith