Ordinary differential equations

Comprehensive study notes, diagrams, and exam preparation for Ordinary differential equations.

Ordinary Differential Equations

Definition

An Ordinary Differential Equation (ODE) is a mathematical equation that relates a function of one independent variable to its derivatives. In the context of numerical methods, we use ODEs to model physical systems where the rate of change of a quantity is dependent on the quantity itself or the independent variable (usually time).


Main Content

1. Initial Value Problems (IVP)

  • An IVP is an ODE along with a specified value for the unknown function at a given point in the domain.
  • Example: Finding the position of a moving object at time $t$ given its initial velocity and position at $t=0$.

2. Classification by Order

  • The order of an ODE is determined by the highest derivative present in the equation.
  • A first-order ODE involves only the first derivative ($dy/dx$), while a second-order ODE involves the second derivative ($d^2y/dx^2$).

3. Numerical Approximation

  • Since many complex ODEs cannot be solved using exact calculus (analytical methods), we use numerical methods to approximate the solution curve step-by-step.
  • This creates a discrete set of points that approximate the continuous function.
Continuous True Solution vs. Numerical Approximation
y |      * (True)
  |    *   * (Numerical)
  |  *
  |*
  +------------------- x

Working / Process

1. Discretization of the Domain

  • The independent variable (e.g., time) is divided into small, equal intervals known as step size, denoted as $h$.
  • This transforms a continuous problem into a series of discrete calculation steps.

2. Selection of an Iterative Algorithm

  • Choose a method based on the required precision. Euler’s Method is the simplest, while Runge-Kutta (RK4) methods are higher-order and more accurate.
  • The formula generally follows: $y_{new} = y_{old} + (\text{slope} \times \text{step size})$.

3. Iterative Calculation

  • Starting from the initial condition $(x_0, y_0)$, compute the next point $(x_1, y_1)$ using the slope function.
  • Repeat the process to generate $y_2, y_3, \dots, y_n$ until the desired end point is reached.

Advantages / Applications

  • Engineering: Predicting the behavior of structural vibrations or heat dissipation in materials over time.
  • Population Dynamics: Modeling how the size of a population changes based on birth and death rates.
  • Computation: Providing a reliable way to solve non-linear differential equations that lack a closed-form analytical solution.

Summary

Ordinary Differential Equations are equations that connect an unknown function to its derivatives, describing how systems evolve over time. Numerical methods allow us to solve these by breaking continuous functions into small, computable steps. Students should remember terms like Initial Value Problem (IVP), Step Size ($h$), and Iterative Approximation.