Search Results for ""

The fast Fourier transform (FFT) is a discrete Fourier transform algorithm which reduces the number of computations needed for N points from 2N^2 to 2NlgN, where lg is the ...

Let lambda_(m,n) be Chebyshev constants. Schönhage (1973) proved that lim_(n->infty)(lambda_(0,n))^(1/n)=1/3. (1) It was conjectured that the number ...

The usual number of scalar operations (i.e., the total number of additions and multiplications) required to perform n×n matrix multiplication is M(n)=2n^3-n^2 (1) (i.e., n^3 ...

A Turing machine is a theoretical computing machine invented by Alan Turing (1937) to serve as an idealized model for mathematical calculation. A Turing machine consists of a ...

Adams' method is a numerical method for solving linear first-order ordinary differential equations of the form (dy)/(dx)=f(x,y). (1) Let h=x_(n+1)-x_n (2) be the step ...

In most computer programs and computing environments, the precision of any calculation (even including addition) is limited by the word size of the computer, that is, by ...

The Archimedean duals are the 13 duals of the 13 Archimedean solids, sometimes called the Catalan solids. They are summarized in the following table and illustrated below ...

The area of a surface or lamina is the amount of material needed to "cover" it completely. The area of a surface or collection of surfaces bounding a solid is called, not ...

Let {a_i}_(i=0)^(N-1) be a periodic sequence, then the autocorrelation of the sequence, sometimes called the periodic autocorrelation (Zwillinger 1995, p. 223), is the ...

The series z=ln(e^xe^y) (1) for noncommuting variables x and y. The first few terms are z_1 = x+y (2) z_2 = 1/2(xy-yx) (3) z_3 = 1/(12)(x^2y+xy^2-2xyx+y^2x+yx^2-2yxy) (4) z_4 ...