Category:Finite differences
![]() | Computing portal |
Here is a list of articles in the Finite differences category of the Computing portal that unifies foundations of mathematics and computations using computers.
Finite differences are composed from differences in a sequence of values, or the values of a function sampled at discrete points. Finite differences are used both in interpolation and numerical analysis, and also play an important role in combinatorics and analytic number theory. The prototypical finite difference equation is the Newton series.
Pages in category "Finite differences"
The following 29 pages are in this category, out of 29 total.
- Finite difference (computing)
B
- Beam and Warming scheme (computing)
C
- Carlson's theorem (computing)
- Central differencing scheme (computing)
- Crank–Nicolson method (computing)
D
- Delta operator (computing)
- Difference polynomials (computing)
- Discrete calculus (computing)
- Discrete Laplace operator (computing)
- Discrete Poisson equation (computing)
- Divided differences (computing)
E
F
- Faulhaber's formula (computing)
- Finite difference coefficient (computing)
- Finite difference method (computing)
G
- Geodesic grid (earth)
H
- Hermite interpolation (computing)
- Higher-order compact finite difference scheme (computing)
I
- Indefinite sum (computing)
- Infinite difference method (computing)
K
- Kronecker sum of discrete Laplacians (computing)
M
- Mean value theorem (divided differences) (computing)
N
- Newton polynomial (computing)
- Nørlund–Rice integral (computing)
P
- Falling and rising factorials (computing)
R
- Reciprocal difference (computing)
T
- Table of Newtonian series (computing)
- Thiele's interpolation formula (computing)
U
- Umbral calculus (computing)