Search Results for ""

An algorithm which allows digits of a given number to be calculated without requiring the computation of earlier digits. The BBP formula for pi is the best-known such ...

A disk algebra is an algebra of functions which are analytic on the open unit disk in C and continuous up to the boundary. A representative measure for a point x in the ...

The finite group T is one of the three non-Abelian groups of order 12 (out of a total of fives groups of order 12), the other two being the alternating group A_4 and the ...

Let G be a subgroup of the modular group Gamma. Then an open subset R_G of the upper half-plane H is called a fundamental region of G if 1. No two distinct points of R_G are ...

The union G=G_1 union G_2 of graphs G_1 and G_2 with disjoint point sets V_1 and V_2 and edge sets X_1 and X_2 is the graph with V=V_1 union V_2 and X=X_1 union X_2 (Harary ...

The Griewank function is a function widely used to test the convergence of optimization functions. The Griewank function of order n is defined by ...

There are three flavors of Hough transform. The first (original) was used to detect straight lines in bubble chamber images. The technique parameterizes pattern space, then ...

A root-finding algorithm based on the iteration formula x_(n+1)=x_n-(f(x_n))/(f^'(x_n)){1+(f(x_n)f^('')(x_n))/(2[f^'(x_n)]^2)}. This method, like Newton's method, has poor ...

A graph Gamma is locally Petersen if, for each point t of Gamma, the graph induced by Gamma on all points adjacent to t (i.e., the neighborhood graph) is isomorphic to the ...

Given n matches (i.e., rigid unit line segments), find the number of topologically distinct planar arrangements which can be made (Gardner 1991). In this problem, two matches ...