TOPICS
Search

Search Results for ""


9311 - 9320 of 13135 for Computational GeometrySearch Results
On a measure space X, the set of square integrable L2-functions is an L^2-space. Taken together with the L2-inner product with respect to a measure mu, <f,g>=int_Xfgdmu (1) ...
A procedure for decomposing an N×N matrix A into a product of a lower triangular matrix L and an upper triangular matrix U, LU=A. (1) LU decomposition is implemented in the ...
Let (q_1,...,q_n,p_1,...,p_n) be any functions of two variables (u,v). Then the expression ...
Given a Taylor series f(x)=f(x_0)+(x-x_0)f^'(x_0)+((x-x_0)^2)/(2!)f^('')(x_0)+... +((x-x_0)^n)/(n!)f^((n))(x_0)+R_n, (1) the error R_n after n terms is given by ...
Let P(N) denote the number of primes of the form n^2+1 for 1<=n<=N, then P(N)∼0.68641li(N), (1) where li(N) is the logarithmic integral (Shanks 1960, pp. 321-332). Let Q(N) ...
A formal logic developed by Alonzo Church and Stephen Kleene to address the computable number problem. In the lambda calculus, lambda is defined as the abstraction operator. ...
An equation proposed by Lambert (1758) and studied by Euler in 1779. x^alpha-x^beta=(alpha-beta)vx^(alpha+beta). (1) When alpha->beta, the equation becomes lnx=vx^beta, (2) ...
The ordinary differential equation (1) (Byerly 1959, p. 255). The solution is denoted E_m^p(x) and is known as an ellipsoidal harmonic of the first kind, or Lamé function. ...
For n>=1, let u and v be integers with u>v>0 such that the Euclidean algorithm applied to u and v requires exactly n division steps and such that u is as small as possible ...
An approximation for the gamma function Gamma(z+1) with R[z]>0 is given by Gamma(z+1)=sqrt(2pi)(z+sigma+1/2)^(z+1/2)e^(-(z+sigma+1/2))sum_(k=0)^inftyg_kH_k(z), (1) where ...
1 ... 929|930|931|932|933|934|935 ... 1314 Previous Next

...