Euler method

The Euler method is a fundamental numerical procedure used in mathematics and computational science. It is specifically designed to solve ordinary differential equations (ODEs) that have a given initial value. An ordinary differential equation is a formula that relates a function to its own derivatives. In many real-world scenarios, we cannot find an exact algebraic solution for these equations. Instead, we use the Euler method to find a numerical approximation. This method is considered a first-order explicit method for numerical integration. It is also recognized as the simplest form of the Runge–Kutta methods.

To understand how the mechanism works, imagine you are trying to trace an unknown curve. You know the starting point, which is called the initial value. You also have a differential equation that acts as a rule for the slope. This rule allows you to calculate the slope of the tangent line at any specific point. The process begins by taking a small step along this tangent line from your starting position. Because the step is small, the slope does not change significantly over that short distance. This allows you to land at a new point that is close to the actual curve. You then repeat this exact same process from your new position. By taking many small steps, you create a polygonal approximation made of connected straight lines.

In technical terms, the Euler method is a first-order process. To implement it, you start with a known value for the variable and its derivative. You must choose a specific value for the size of every step, often called the step size, denoted as $h$. The method is called "explicit" because the next value in the sequence is calculated directly from the current known values. While it is primarily used for first-order ODEs, it can handle higher-order equations as well. Any ODE of a higher order can be rewritten as a system of first-order ODEs. Once converted, these systems can be processed using the standard Euler formulas.

This mathematical technique is named after the Swiss mathematician Leonhard Euler. He first proposed the method in his influential book, *Institutionum calculi integralis*. This work was published between the years 1768 and 1770. Euler's contributions laid the groundwork for much of modern calculus and numerical analysis. His method remains a vital starting point for students and scientists today. It serves as the conceptual basis for constructing more sophisticated mathematical tools. Many advanced algorithms, such as predictor–corrector methods, are built upon these original ideas.

The accuracy of the Euler method is defined by its error characteristics. It is classified as a first-order method because of how its errors scale. The local truncation error, which is the error made in a single step, is proportional to the square of the step size. However, the global truncation error is the cumulative error at a fixed time. This global error is proportional to the step size itself. For example, if you reduce the step size by half, the total error also becomes approximately half as large. While smaller steps increase accuracy, they also increase the computational cost. To achieve an answer correct to three decimal places in certain cases, a computer might require 400,000 steps.

Despite its utility, the Euler method can suffer from numerical instability. This occurs most often with "stiff" equations, where the solution changes very rapidly. In an unstable state, the numerical approximation may oscillate or grow much larger than the actual solution. For instance, an equation that should decay toward zero might instead explode toward infinity if the step size is too large.

To prevent this, mathematicians study the stability region. This is a specific area that shows which step sizes will result in a stable calculation. If the product of the step size and the equation's constant falls outside this pink disk-shaped region, the method fails.

The Euler method connects deeply to broader fields like physics and engineering. Many physical models contain terms that represent fast-decaying elements. These elements can force a user to use an exceptionally small timestep to avoid instability. Because of these limitations and the slow rate of convergence, higher-order methods are often preferred. Methods like the Runge–Kutta or linear multistep methods provide much greater precision for the same amount of work. Nevertheless, the Euler method remains a cornerstone of mathematical education and a vital tool for understanding numerical integration.