Search Results for ""

Let the values of a function f(x) be tabulated at points x_i equally spaced by h=x_(i+1)-x_i, so f_1=f(x_1), f_2=f(x_2), ..., f_5=f(x_5). Then Boole's rule approximating the ...

Let the values of a function f(x) be tabulated at points x_i equally spaced by h=x_(i+1)-x_i, so f_1=f(x_1), f_2=f(x_2), ..., f_(11)=f(x_(11)). Then Shovelton's rule ...

The word weight has many uses in mathematics. It can refer to a function w(x) (also called a weighting function or weighting function) used to normalize orthogonal functions. ...

A sorting algorithm which makes n passes over a set of n elements, in each pass selecting the smallest element and deleting it from the set. This algorithm has running time ...

The equations are x = 2/(sqrt(pi(4+pi)))(lambda-lambda_0)(1+costheta) (1) y = 2sqrt(pi/(4+pi))sintheta, (2) where theta is the solution to ...

The equations are x = ((lambda-lambda_0)(1+costheta))/(sqrt(2+pi)) (1) y = (2theta)/(sqrt(2+pi)), (2) where theta is the solution to theta+sintheta=(1+1/2pi)sinphi. (3) This ...

The Mollweide projection is a map projection also called the elliptical projection or homolographic equal-area projection. The forward transformation is x = ...

Simpson's rule is a Newton-Cotes formula for approximating the integral of a function f using quadratic polynomials (i.e., parabolic arcs instead of the straight line ...

pi may be computed using a number of iterative algorithms. The best known such algorithms are the Archimedes algorithm, which was derived by Pfaff in 1800, and the ...

The all-pairs shortest path problem is the determination of the shortest graph distances between every pair of vertices in a given graph. The problem can be solved using n ...