Numerical differentiation
Definition
Let be an integer, let be a real function defined near a point , and let be distinct real numbers. A numerical differentiation formula for the -th derivative is an expression with real coefficients that do not depend on or . It has order if as for every of class near , in big O notation. Numerical differentiation is the approximation of by such formulas, or more generally by derivatives of functions fitted to finitely many values of .
Remarks
Example: the central difference for , with stencil and , has order . Check with Taylor's theorem for : , so . The forward difference has only order , with error . Non-example: approximates no derivative; for it equals , which does not tend to . In floating-point arithmetic with unit round-off , the forward difference has total error about , which is smallest for of the order of .
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Big O notation concept
- Derivative concept
- Higher derivative concept
- Numerical differentiation definition
Further reading
About this page
| Tag | VSTM4MZJXZ |
|---|---|
| URI | m2://VSTM4MZJXZ |
| Kind | definition |
| Writing | W0 stub |
| MSC | 65D25 |
| Defines | Numerical differentiation |
| Uses | Derivative, Higher derivative, Big O notation |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- 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
No page links to this page yet.