Newton's-Method

Graphical calculator for the Newton method

The diagram shows the chosen number of iteration steps from the start value in linear lines. The dotted lines show the start value of the next iteration step. You can grap the start point in the diagram and move along the function.

Scale:
Number of iterations=
Start value x0=
Number of digits=
Function f(x):
Linear line:

Parameter values

a=
b=
c=

Axes ranges

x-min=
x-max=
y-min=
y-max=

Parameter ranges

a-min=
a-max=
b-min=
b-max=
c-min=
c-max=

Calculated iterations with Newton method

f(x)=

clear

Calculate

Pos1

Ende

7

8

9

/

x

y

z

4

5

6

*

(

)

1

2

3

-

a

b

c

0

.

+

sin

cos

tan

ex

ln(x)

xa

^

asin

acos

atan

x2

x

x3

x4

()()

sinh

cosh

ax+cbx+c

a+xb+x

x2-a2x2+a2

1a+bx

1+x1-x

x+a

eax

ex

ae-bx2+c

sin(x)cos(x)

ax2+bx+c

exsin(x)cos(x)

1ax

aebx+c

eax

eax2

1eax

xex

1sin

1cos

1tan

asin(bx+c)

acos(bx+c)

atan(bx+c)

asin2(bx+c)

Notation: The function must be entered in the notation of the Javascript syntax.

Parameter: Three constants a, b and c are available, which can be changed by means of the sliders. The start point is shown by the black cross in the diagram and can be moved.

Description of the Newton method

The aim of the Newton method is to find a zero of a generally non-linear function. That is to find a solution of the equation

f(x)=0

To achieve this, the function is linearized at a position x0 by replacing the function with its tangent. Thus, by a straight line equation which passes through the point (x0), the slope f '(x0).

The general form of the straight line equation is

y=ax+b

Conditions

f(x0)=f(x0)x0+b

Dissolving after b

b=f(x0)-f(x0)x0

Thus the straight line equation is completely determined

y=f(x0)x+f(x0)-f(x0)x0 =f(x0)+f(x0)(x-x0)

The desired zero point of f is now replaced by the zero point of the straight line equation as the first approximation.

0=f(x0)+f(x0)(x-x0)

Resolving to x gives the first approximation for the zero point.

x=x0-f(x0)f(x0)

The iteration is to use this approximation as the starting point for the next approximation. The iteration process is then as follows:

xn+1=xn-f(xn)f(xn)

with any starting value x0. Against which and if at all the Newton method converges depends sensitively on the choice of the starting value.

Example for Newton's method

The example shows the iteration steps of the Newton method to find numerically the root of a quadratic function.

The example function is:

f(x)=x2-x

The derivative is:

f(x)=2x-1

We use as start value:

x0=3.5

The first iteration step is:

x1=x0-f(x0)f(x0)=3.5-8.756.5=2.04167

Newton_Example_Step_1

The function value at the first iteration step is:

f(x1)=2.12674

f(x1)=3.08334

So the second iteration step is:

x2=x1-f(x1)f(x1) =2.04167-2.126743.08334=1.35192

Newton_Example_Step_2

And so on for further iteration steps.

Usable expressions in the definition of the function f(x)

Constants

NameDescription
LN2Natural logarithm of 2
LN10Natural logarithm of 10
LOG2EBase 2 logarithm of EULER
LOG10EBase 10 logarithm of EULER
PIRatio of the circumference of a circle to its diameter
SQRT1_2Square root of 1/2
SQRT2Square root of 2

Trigonometric Functions

FunctionDescription
sin(x)sine of x
cos(x)Cosine of x
tan(x)Tangent of x
asin(x)arcsine
acos(x)arccosine of x
atan(x)arctangent of x
atan2(y, x)Returns the arctangent of the quotient of its arguments.
cosh(x)Hyperbolic cosine of x
sinh(x)Hyperbolic sine of x

Logarithm and Exponential

FunctionDescription
pow(b, e)e to the b
sqrt(x)Square root of x
exp(x)EULER to the x
log(x), ln(x)Natural logarithm
log(x, b)Logarithm to base b
log2(x), lb(x)Logarithm to base 2
log10(x), ld(x)Logarithm to base 10

More functions

FunctionDescription
ceil(x)Get smallest integer n with n > x.
abs(x)Absolute value of x
max(a, b, c, ...)Maximum value of all given values.
min(a, b, c, ...)Minimum value of all given values.
random(max = 1)Generate a random number between 0 and max.
round(v)Returns the value of a number rounded to the nearest integer.
floor(x)Returns the biggest integer n with n < x.
factorial(n)Calculates n!
trunc(v, p = 0)Truncate v after the p-th decimal.
V(s)Returns the value of the given element, e.g. sliders and angles.

Screenshot of the Image

Print or save the image via right mouse click.

More Calculators

Here is a list of of further useful calculators and sites:

Index Regression Calculator NxN Cramer's rule Calculator NxN Gauss method Matrix Determinant Derivative calculus Partial derivatives and gradient Differential equations