---
title: "Numerical Schemes for Evolution Equations"
description: "Replace the derivatives by differences and a differential equation becomes a recursion. Consistency and stability together give convergence, and the stability condition is what caps the time step."
canonical: https://lightmysky.com/learn/mathematics/numerical-schemes-for-evolution-equations-mt_RuDbOapexB
source: https://lightmysky.com/learn/mathematics/numerical-schemes-for-evolution-equations-mt_RuDbOapexB.md
retrieved: 2026-09-12
---

> **Agent view.** This is the Markdown twin of the page, for tools and assistants.
> When to use this site, and the call that answers each job: https://lightmysky.com/agent-instructions.md
> API description (OpenAPI 3.1): https://lightmysky.com/openapi.json · Authentication: https://lightmysky.com/auth.md
> Pricing: https://lightmysky.com/pricing.md · Catalog: https://lightmysky.com/llms.txt · Full catalog: https://lightmysky.com/llms-full.txt
> Every machine-readable file on this domain: https://lightmysky.com/.well-known/ai-catalog.json
> Ask for Markdown with `Accept: text/markdown`, a `.md` address, or `?mode=agent`.

# Numerical Schemes for Evolution Equations

Replace the derivatives by differences and a differential equation becomes a recursion. Consistency and stability together give convergence, and the stability condition is what caps the time step.

Subject: Mathematics · Area: Differential Equations · Ages 23 to 24
Page: https://lightmysky.com/learn/mathematics/numerical-schemes-for-evolution-equations-mt_RuDbOapexB

## Ready when they can

- Derive a finite difference scheme and state its order of accuracy
- Test a scheme for stability and read off the step-size restriction
- Explain why an explicit scheme for the heat equation needs a small time step

## Lesson: Turning change into steps

Differential equations describe change, and direction fields draw that change as tiny arrows across the plane. Following the arrows by hand sketches solutions without solving anything. Euler automates the walk: step along the local arrow, re-aim, repeat.

**Example.** The heat equation says the future is local averaging, and explicit schemes copy it onto a grid: each new value blends its old self with its neighbours, weighted by r. The mesh ratio is r = k dt over dx squared; with k = 1, dt = 0.01, dx = 0.1, dx squared is 0.01, so r is 1. The scheme uses a forward time difference with a centred space difference: first order in time, second in space.

Stability analysis asks whether the blending calms or amplifies grid noise, and it caps the step: stability needs r below or at 1 over 2. Since r ties dt to dx squared, halving dx quarters the allowed dt. That is why an explicit heat scheme forces tiny time steps on fine grids.

**Tip.** Consistency plus stability gives convergence, and neither alone suffices. A consistent scheme without stability returns nonsense, however fine the grid. Taylor logic rates the accuracy, the same way rectangles, trapezoids, and parabolas rate quadrature.

**Recap.** Replace derivatives with differences, keep the mesh ratio inside its stability bound, and consistency will mature into convergence.

## Practice

18 questions on this page, each with its working shown.

## Needs first

- [Direction Fields and Euler's Method](https://lightmysky.com/learn/mathematics/direction-fields-and-eulers-method-mt_Ak-TZOX3GR)
- [Separation of Variables and the Heat Equation](https://lightmysky.com/learn/mathematics/separation-of-variables-and-the-heat-equation-mt_XnPDL0X1TL)