Math 2.0

Numerical analysis Time-dependent partial differential equations Concept

Finite difference method

Summary

The finite difference method solves differential equations approximately on a grid of points. It replaces each derivative by a difference quotient of the values at nearby grid points, which turns the equation into a system of algebraic equations. It is the oldest and simplest numerical method for partial differential equations. Its convergence rests on consistency and stability, as in the Lax equivalence theorem. For time-dependent problems, stability often requires a step restriction such as the Courant–Friedrichs–Lewy condition.

Where this leads

3 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Finite_difference_method
About this page
TagX7HYEBA5SA
URIm2://X7HYEBA5SA
Kindconcept
WritingW0 stub
MSC65M06, 65N06
Same as
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Definitions

Used by

Results about this

Special cases