Approximating solutions using an iterative process 

In this lesson, you will learn how to calculate the square root of a number using Newton's Method. We will then go over its implementation in Scala.

We'll cover the following

Newton’s Method

Computing the Square Root of x

Implementation in Scala

In this lesson, we will define a function which will calculate the square root of a given number. The implementation of the function will be based on Newton’s Method.

svg viewer

Newton’s Method

Newton’s method is used for approximating solutions. It is an iterative process and starts with an initial estimate which is used to find a better approximation which is then further used to find a better approximation until we reach the required result.

Computing the Square Root of x

To compute the square root of a number, x, we first need to make an initial estimate, y, let’s say 1. We improve the estimate by taking the average of y and x/y.

Let’s look at an example. The table below shows how Newtons method would compute the square root of 4 by approximation.

svg viewer

If we continue the above calculations, the average would eventually converge to 2.

Brace yourself because below, you’ll be introduced to your first extensive Scala program!

Implementation in Scala

To implement the above method in Scala, we need to define five functions interdependent with each other.

abs(): will return the absolute value of a given number

isGoodEnough(): will let us know if the average is close enough to the actual value

improve(): will return the average of y and x/y

sqrtIter(): a recursive function which will compute each iteration of Newton’s method

sqrt(): Will use the sqrtIter() function and return the square root of the given number

When defining a function dependent on other functions, make sure to define them above the dependent function.