language-icon Old Web
English
Sign In

Finite difference

A finite difference is a mathematical expression of the form f (x + b) − f (x + a). If a finite difference is divided by b − a, one gets a difference quotient. The approximation of derivatives by finite differences plays a central role in finite difference methods for the numerical solution of differential equations, especially boundary value problems. Certain recurrence relations can be written as difference equations by replacing iteration notation with finite differences. Today, the term 'finite difference' is often taken as synonymous with finite difference approximations of derivatives, especially in the context of numerical methods. Finite difference approximations are finite difference quotients in the terminology employed above. Finite differences were introduced by Brook Taylor in 1715 and have also been studied as abstract self-standing mathematical objects in works by George Boole (1860), L. M. Milne-Thomson (1933), and Károly Jordan (1939). Finite differences trace their origins back to one of Jost Bürgi's algorithms (c. 1592) and work by others including Isaac Newton. The formal calculus of finite differences can be viewed as an alternative to the calculus of infinitesimals. Three forms are commonly considered: forward, backward, and central differences. A forward difference is an expression of the form Depending on the application, the spacing h may be variable or constant. When omitted, h is taken to be 1: Δ(x) = Δ1(x).

[ "Calculus", "Mathematical optimization", "Mathematical analysis", "Compact finite difference", "finite difference algorithm", "MacCormack method", "finite difference analysis", "high order compact" ]
Parent Topic
Child Topic
    No Parent Topic