4.2. Euler's Method

Euler’s method is one of the simplest and most straightforward numerical techniques for solving ODEs. It approximates the solution of the ODE by discretizing the time domain into small steps and iteratively updating the solution based on the function's derivative.

Euler's Method is designed to solve ordinary differential equations (ODEs) by breaking down the problem into smaller steps. In this method, we start with an initial point and move step by step through time intervals (or increments) based on the derivative of the function at each point. At each step, we calculate what the next value of our function would be based on the derivative, thus creating a series of approximations that represent the function over time.

Imagine you are walking in a straight line. If you know your starting point and the direction you are moving (this represents the derivative), you can predict where you will be after a short while (the next point). By repeating this process—re-evaluating your direction and updating your position—you can trace your path.

Given an ODE of the form: dydt=f(t,y),y(t0)=y0 Euler’s method approximates the solution at each step as: yn+1=yn+h⋅f(tn,yn) Where: ● yny_n is the approximation of the solution at step nn, ● hh is the step size (the distance between successive points), ● f(tn,yn)f(t_n, y_n) is the derivative of yy at the point (tn,yn)(t_n, y_n).

This formula is the heart of Euler's Method. In simple terms, we start with an initial value of y at time t0. From there, we calculate the derivative f(t_n, y_n) at that point. By multiplying this derivative by a small step size h (which dictates how far we are moving in our next approximation), we get the change in y. We then add this change to our current approximation y_n to find the next approximate value y_{n+1}. This process is repeated for each step, allowing us to build the approximate solution iteratively.

Think of this like taking small steps on a path—each step covers a tiny distance determined by how steep the incline is at that point. The step size represents how far you are stepping forward, and the slope represents the change in elevation. By knowing how steep the path is, you can predict where you'll end up after each small step.

1. Start with an initial condition y(t0)=y0.
2. Compute the derivative f(t0,y0) using the ODE.
3. Use the Euler update formula to compute y1.
4. Repeat the process for each subsequent step, using the previous solution to calculate the next one.

The implementation of Euler's Method follows a straightforward sequence: you begin by identifying your starting point (the initial condition). Next, you calculate the slope (derivative) of your function at this point. Using that slope, you apply the Euler formula to find the next value of y, moving forward in time. You continue this process for each subsequent point, always re-evaluating the slope based on the most recent value of y you have calculated.

Imagine you're filling a bathtub with water. You start with a certain amount of water (initial condition). By measuring how fast the water is flowing in (the derivative), you can estimate how much water will be in the tub after a short time (next step). As you keep adding water and measuring the flow, you build up a picture of the total water in the tub over time.

● Advantages: ○ Very simple to implement and understand. ○ Computationally inexpensive. ● Disadvantages: ○ Low accuracy: Euler’s method is only a first-order method, meaning the error decreases linearly with the step size h. ○ Instability: For stiff equations or large step sizes, Euler’s method may produce inaccurate or unstable results.

Euler's method is extremely accessible, which is one of its main advantages; it's easy to understand and implement, making it a go-to option for learning numerical solutions. However, it has significant limitations. It is a first-order method, which means that the error in approximations decreases only linearly as the step size h gets smaller. Additionally, this method can lead to inaccuracies when dealing with stiff equations, where larger step sizes can cause drastic errors in the results.

Consider Euler's Method like using a basic measuring tape that you can only use to measure in one-foot increments. While this is simple and straightforward (easy to understand), if you need precision (like measuring something small or fine), it can lead to large errors. Especially if the object (the scenario you're measuring) has intricate details—it could lead to an oversimplified and inaccurate representation.

For the ODE: dydt=y,y(0)=1 Euler's method approximates the solution at each step as follows: ● Let h=0.1 be the step size. ● For t0=0,y0=1: y1=y0+h⋅f(t0,y0)=1+0.1⋅1=1.1 ● Repeat for the next steps, updating yn using the Euler formula.

In this example, we are solving the initial value problem where the rate of change of y is equal to y itself, starting at t=0 with y=1. We choose a step size of 0.1. The first calculation updates our initial condition by calculating the derivative, which is also 1 at this point. Using the Euler formula, we find the next approximate value y1 by adding the change (0.1) to our current value (1), resulting in 1.1. We would then repeat this process for further time steps to continue approximating the solution.

This resembles keeping track of a plant's growth over time. If today (t0) the plant is 1 inch tall and grows at a constant rate of 1 inch per day, then after a day of time (with a chosen increment of 0.1 days), you estimate it will be 1.1 inches tall. By measuring a little each day, you can get a continuous approximation of the plant's height.

--