Numerical Approximation involves using mathematical techniques to find approximate solutions to mathematical problems that may not be easy to solve exactly. Euler's method is a basic—yet powerful—technique for doing this with differential equations, particularly when dealing with initial value problems. In our exercise, Euler's method gives us approximate solutions \( u_1 \) and \( u_2 \) as steps to solving the differential equation using a specified time step \( \Delta t = 0.2 \). Instead of calculating the exact continuous trajectory of the solution, Euler's method incrementally progresses in small steps, predicting the new values based on current information. It uses a simple formula:
- \( u_{n+1} = u_n + \Delta t \cdot f(t_n, u_n) \)
With each step, we obtain a new approximation. This iterative nature can introduce some errors, but it also allows us to gain insights into the nature of solutions without full-on solving the differential equation analytically. The smaller the time step, generally, the closer the approximation will be to the actual solution.