In an earlier article (Elgin, 2006) we looked at algorithms for finding the square root of a number. The iterative schemes were set up so that the order of the method was high, therefore giving a method which converged quickly to the root of the number N. In this article I wish to present some different algorithms for finding a square root and also look at the error term which will give us an indication of the accuracy at each stage of the iteration process.
展开▼
