10.1.2. Prerequisites

Before diving into the method, it's important to understand:

• First-order ODE of the form:

$\frac{dy}{dx} = f(x,y), \; y(x_0) = y_0$

A first-order ordinary differential equation (ODE) is a type of equation that involves a function, its derivatives, and sometimes, a variable. Specifically, it is written in the form $\frac{dy}{dx} = f(x,y)$, meaning that the rate of change of $y$ with respect to $x$ depends on both $x$ and $y$. Additionally, the notation $y(x_0) = y_0$ specifies an initial condition, indicating the value of $y$ at a specific point $x_0$. To appropriately apply numerical methods, one must recognize this structure to understand what to solve for during calculations.

Think of a car's speed while driving on a road: the speed can depend on various factors including how far along the road you are (the position, $x$) and the car's current speed (the value of $y$). If you want to know how to adjust your speed over time (which would be the derivative or the change in speed), understanding this relationship is critical.

• The goal is to compute the value of $y$ at $x = x_n$ using numerical steps.

The main objective of using numerical methods like the Modified Euler’s Method is to estimate the value of $y$ at a particular point, denoted as $x_n$. In this method, the continuous movement from one point to the next (from $x_n$ to $x_{n+1}$) necessitates performing numerical calculations step-by-step. Consequently, this breaks down the solution into manageable parts that can be computed and approximated.

Imagine navigating a long hiking trail where you need to reach the summit (the value of $y$ at $x = x_n$). Instead of making it to the summit all at once (finding an exact solution), you move forward by taking small steps, checking your path frequently to ensure you're on track—much like the calculations in a numerical method.

• Step size: $h = x_{n+1} - x_n$

In numerical methods, the step size $h$ represents the distance between two points on the $x$ axis where the calculations will occur. It is computed as the difference between the next position $x_{n+1}$ and the current position $x_n$. A smaller step size may lead to more accurate results as it allows for finer approximations, although it also increases the computational effort.

Consider walking along a path marked by stepping stones. Choosing smaller steps (a smaller $h$) between stones ensures you stay close to the path (the actual solution). If your steps are too long, you might miss important turns or details, just as a larger step size can lead to inaccuracies in numerical solutions.

--