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 ...

A Gaussian quadrature-like formula over the interval [-1,1] which has weighting function W(x)=x. The general formula is int_(-1)^1xf(x)dx=sum_(i=1)^nw_i[f(x_i)-f(-x_i)]. n ...

The circle method is a method employed by Hardy, Ramanujan, and Littlewood to solve many asymptotic problems in additive number theory, particularly in deriving an asymptotic ...

A Gaussian quadrature-like formula for numerical estimation of integrals. It requires m+1 points and fits all polynomials to degree 2m, so it effectively fits exactly all ...

A quadrilateral which has an incircle, i.e., one for which a single circle can be constructed which is tangent to all four sides. Opposite sides of such a quadrilateral ...

A hexagonal prism is a prism composed of two hexagonal bases and six rectangular sides. It is an octahedron. The regular right hexagonal prism is a space-filling polyhedron. ...

The polyhedron compound of the truncated dodecahedron and its dual, the triakis icosahedron. The compound can be constructed from a truncated dodecahedron of unit edge length ...

The polyhedron compound of the truncated icosahedron and its dual, the pentakis dodecahedron. The compound can be constructed from a truncated icosahedron of unit edge length ...

Consider any star of n line segments through one point in space such that no three lines are coplanar. Then there exists a polyhedron, known as a zonohedron, whose faces ...

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 ...