Concept

Table of Newtonian series

In mathematics, a Newtonian series, named after Isaac Newton, is a sum over a sequence written in the form where is the binomial coefficient and is the falling factorial. Newtonian series often appear in relations of the form seen in umbral calculus. The generalized binomial theorem gives A proof for this identity can be obtained by showing that it satisfies the differential equation The digamma function: The Stirling numbers of the second kind are given by the finite sum This formula is a special case of the kth forward difference of the monomial xn evaluated at x = 0: A related identity forms the basis of the Nörlund–Rice integral: where is the Gamma function and is the Beta function. The trigonometric functions have umbral identities: and The umbral nature of these identities is a bit more clear by writing them in terms of the falling factorial . The first few terms of the sin series are which can be recognized as resembling the Taylor series for sin x, with (s)n standing in the place of xn. In analytic number theory it is of interest to sum where B are the Bernoulli numbers. Employing the generating function its Borel sum can be evaluated as The general relation gives the Newton series where is the Hurwitz zeta function and the Bernoulli polynomial. The series does not converge, the identity holds formally. Another identity is which converges for . This follows from the general form of a Newton series for equidistant nodes (when it exists, i.e.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Related lectures (3)
Polynomial Interpolation: Lagrange Method
Covers the Lagrange polynomial interpolation method and error analysis in function approximation.
Show more
Related concepts (2)
Newton polynomial
In the mathematical field of numerical analysis, a Newton polynomial, named after its inventor Isaac Newton, is an interpolation polynomial for a given set of data points. The Newton polynomial is sometimes called Newton's divided differences interpolation polynomial because the coefficients of the polynomial are calculated using Newton's divided differences method. Given a set of k + 1 data points where no two xj are the same, the Newton interpolation polynomial is a linear combination of Newton basis polynomials with the Newton basis polynomials defined as for j > 0 and .
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. The difference operator, commonly denoted is the operator that maps a function f to the function defined by A difference equation is a functional equation that involves the finite difference operator in the same way as a differential equation involves derivatives.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.