Search Results for ""

Let V be an n-dimensional linear space over a field K, and let Q be a quadratic form on V. A Clifford algebra is then defined over T(V)/I(Q), where T(V) is the tensor algebra ...

A nonhomogeneous linear equation or system of nonhomogeneous linear systems of equations is said to be affine.

A constant, sometimes also called a "mathematical constant," is any well-defined real number which is significantly interesting in some way. In this work, the term "constant" ...

The engineering terminology for one use of Fourier transforms. By breaking up a wave pulse into its frequency spectrum f_nu=F(nu)e^(2piinut), (1) the entire signal can be ...

Functions which can be expressed in terms of Legendre functions of the first and second kinds. See Abramowitz and Stegun (1972, p. 337). P_(-1/2+ip)(costheta) = (1) = ...

R_m(x,y) = (J_m^'(x)Y_m^'(y)-J_m^'(y)Y_m^'(x))/(J_m(x)Y_m^'(y)-J_m^'(y)Y_m(x)) (1) S_m(x,y) = (J_m^'(x)Y_m(y)-J_m(y)Y_m^'(x))/(J_m(x)Y_m(y)-J_m(y)Y_m(x)). (2)

If lim_(z->z_0)(f(z)-f(z_0))/(z-z_0) is the same for all paths in the complex plane, then f(z) is said to be monogenic at z_0. Monogenic therefore essentially means having a ...

F(x) = -Li_2(-x) (1) = int_0^x(ln(1+t))/tdt, (2) where Li_2(x) is the dilogarithm.

The lemniscate functions arise in rectifying the arc length of the lemniscate. The lemniscate functions were first studied by Jakob Bernoulli and Giulio Fagnano. A historical ...

The simplex method is a method for solving problems in linear programming. This method, invented by George Dantzig in 1947, tests adjacent vertices of the feasible set (which ...