Search Results for ""

The Chebyshev polynomials of the first kind are a set of orthogonal polynomials defined as the solutions to the Chebyshev differential equation and denoted T_n(x). They are ...

A mathematical procedure for finding the best-fitting curve to a given set of points by minimizing the sum of the squares of the offsets ("the residuals") of the points from ...

Geometry

A definite integral is an integral int_a^bf(x)dx (1) with upper and lower limits. If x is restricted to lie on the real line, the definite integral is known as a Riemann ...

The n-ball, denoted B^n, is the interior of a sphere S^(n-1), and sometimes also called the n-disk. (Although physicists often use the term "sphere" to mean the solid ball, ...

The improvement of the convergence properties of a series, also called convergence acceleration or accelerated convergence, such that a series reaches its limit to within ...

Simply stated, floating-point algebra is algebra performed on floating-point representations by any number of automated devices. Traditionally, this definition is phrased so ...

The Gegenbauer polynomials C_n^((lambda))(x) are solutions to the Gegenbauer differential equation for integer n. They are generalizations of the associated Legendre ...

The Lagrange interpolating polynomial is the polynomial P(x) of degree <=(n-1) that passes through the n points (x_1,y_1=f(x_1)), (x_2,y_2=f(x_2)), ..., (x_n,y_n=f(x_n)), and ...

Let p(d) be the probability that a random walk on a d-D lattice returns to the origin. In 1921, Pólya proved that p(1)=p(2)=1, (1) but p(d)<1 (2) for d>2. Watson (1939), ...