Search Results for ""

The Eulerian number <n; k> gives the number of permutations of {1,2,...,n} having k permutation ascents (Graham et al. 1994, p. 267). Note that a slightly different ...

The Cauchy principal value of a finite integral of a function f about a point c with a<=c<=b is given by ...

The conjugate gradient method is an algorithm for finding the nearest local minimum of a function of n variables which presupposes that the gradient of the function can be ...

The average distance between two points chosen at random inside a unit cube (the n=3 case of hypercube line picking), sometimes known as the Robbins constant, is Delta(3) = ...

A recurrence equation (also called a difference equation) is the discrete analog of a differential equation. A difference equation involves an integer function f(n) in a form ...

The qubit |psi>=a|0>+b|1> can be represented as a point (theta,phi) on a unit sphere called the Bloch sphere. Define the angles theta and phi by letting a=cos(theta/2) and ...

The Bonne projection is a map projection that resembles the shape of a heart. Let phi_1 be the standard parallel, lambda_0 the central meridian, phi be the latitude, and ...

A map projection with transformation equations x = rhosintheta (1) y = rho_0-rhocostheta, (2) where rho = (G-phi) (3) theta = n(lambda-lambda_0) (4) rho_0 = (G-phi_0) (5) G = ...

Cylindrical coordinates are a generalization of two-dimensional polar coordinates to three dimensions by superposing a height (z) axis. Unfortunately, there are a number of ...

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