# Euler method

This online calculator implements Euler's method, which is a first order numerical method to solve first degree differential equations with a given initial value.

This content is licensed under Creative Commons Attribution/Share-Alike License 3.0 (Unported). That means you may freely redistribute or modify this content under the same license conditions and must attribute the original author by placing a hyperlink from your site to this work https://planetcalc.com/8393/. Also, please do not modify any references to the original work (if any) contained in this content.

You can use this calculator to solve first degree differential equations with a given initial value, using Euler's method.

To use this method, you should have a differential equation in the form

You enter the right side of the equation *f(x,y)* in the *y'* field below.

You also need the initial value as

and the point for which you want to approximate the value.

The last parameter of the method – a step size – is literally a step along the tangent line to compute the next approximation of a function curve.

If you know the exact solution of a differential equation in the form *y=f(x)*, you can enter it as well. In this case, the calculator also plots the solution along with the approximation on the graph, and computes the absolute error for each step of the approximation.

A method explanation can be found below the calculator.

### Euler method

So, let's suppose we have the following

If we calculate

we will find the derivative *y'* at the initial point.

For sufficiently small , we can approximate the next value of *y* as

Or, shorter

And in the general case

We continue to calculate the next *y* values using this relation until we reach target *x* point.

This is the essence of Euler's method. is the step size. The error on each step (local truncation error) is roughly proportional to the square of the step size, so the Euler method is more accurate if the step size is smaller. However, global truncation error is the cumulative effect of the local truncation errors and is proportional to the step size, and that's why the Euler method is said to be a first order method.

More complicated methods can achieve a higher order (and more accuracy). One possibility is to use more function evaluations. This is illustrated by the Midpoint method

## Comments