Mean value theorem (divided differences)

In mathematical analysis, the mean value theorem for divided differences generalizes the mean value theorem to higher derivatives.[1]

Statement of the theorem

For any n + 1 pairwise distinct points x0, ..., xn in the domain of an n-times differentiable function f there exists an interior point

where the nth derivative of f equals n ! times the nth divided difference at these points:

For n = 1, that is two function points, one obtains the simple mean value theorem.

Proof

Let be the Lagrange interpolation polynomial for f at x0, ..., xn. Then it follows from the Newton form of that the highest term of is .

Let be the remainder of the interpolation, defined by . Then has zeros: x0, ..., xn. By applying Rolle's theorem first to , then to , and so on until , we find that has a zero . This means that

,

Applications

The theorem can be used to generalise the Stolarsky mean to more than two variables.

gollark: ```javascriptimport { app } from "hyperapp"import { h } from 'ijk'interface Thing { name: String, children: () => Array<Thing> | Array<Thing>}const state = { count: 0} const actions = { down: value => state => ({ count: state.count - value }), up: value => state => ({ count: state.count + value })} const viewThing = ["div", ]const view = (state, actions) => h("nodeName", "attributes", "children")(["main", [ ["button", { onclick: () => actions.up(1) }, "Increase"], ["button", { onclick: () => actions.down(1) }, "Decrease"], state.count.toString(16)]]) app(state, actions, view, document.body)```Not related but hey it's <#348702212110680064>.
gollark: Ruby.
gollark: ```rubyputs "Hello, WOrld"```
gollark: RPNCalc 3:```rpncalcthis-cant-handle-strings-so-whatever```
gollark: ++C.

References

  1. de Boor, C. (2005). "Divided differences". Surv. Approx. Theory. 1: 46–69. MR 2221566.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.