Search Results for ""

Given collinear points W, X, Y, and Z, Y and Z are harmonic conjugates with respect to W and X if (|WY|)/(|YX|)=(|WZ|)/(|XZ|). (1) W and X are also harmonic conjugates with ...

In elliptic cylindrical coordinates, the scale factors are h_u=h_v=sqrt(sinh^2u+sin^2v), h_z=1, and the separation functions are f_1(u)=f_2(v)=f_3(z)=1, giving a Stäckel ...

In parabolic cylindrical coordinates, the scale factors are h_u=h_v=sqrt(u^2+v^2), h_z=1 and the separation functions are f_1(u)=f_2(v)=f_3(z)=1, giving Stäckel determinant ...

Divide a set of data into two groups (high and low) of equal size at the statistical median if there is an even number of data points, or two groups consisting of points on ...

Also known as metric entropy. Divide phase space into D-dimensional hypercubes of content epsilon^D. Let P_(i_0,...,i_n) be the probability that a trajectory is in hypercube ...

The Landau-Mignotte bound, also known as the Mignotte bound, is used in univariate polynomial factorization to determine the number of Hensel lifting steps needed. It gives ...

In bispherical coordinates, Laplace's equation becomes (1) Attempt separation of variables by plugging in the trial solution f(u,v,phi)=sqrt(coshv-cosu)U(u)V(v)Psi(psi), (2) ...

In toroidal coordinates, Laplace's equation becomes (1) Attempt separation of variables by plugging in the trial solution f(u,v,phi)=sqrt(coshu-cosv)U(u)V(v)Psi(psi), (2) ...

Long division is an algorithm for dividing two numbers, obtaining the quotient one digit at a time. The example above shows how the division of 123456/17 is performed to ...

Consider n intersecting circles. The maximal number of regions into which these divide the plane are N(n)=n^2-n+2, giving values for n=1, 2, ... of 2, 4, 8, 14, 22, 32, 44, ...