Search Results for ""

Newton's method for finding roots of a complex polynomial f entails iterating the function z-[f(z)/f^'(z)], which can be viewed as applying the Euler backward method with ...

A very general theorem that allows the number of discrete combinatorial objects of a given type to be enumerated (counted) as a function of their "order." The most common ...

The field of semidefinite programming (SDP) or semidefinite optimization (SDO) deals with optimization problems over symmetric positive semidefinite matrix variables with ...

The Gegenbauer polynomials C_n^((lambda))(x) are solutions to the Gegenbauer differential equation for integer n. They are generalizations of the associated Legendre ...

The bivariate normal distribution is the statistical distribution with probability density function P(x_1,x_2)=1/(2pisigma_1sigma_2sqrt(1-rho^2))exp[-z/(2(1-rho^2))], (1) ...

There are two kinds of Bell polynomials. A Bell polynomial B_n(x), also called an exponential polynomial and denoted phi_n(x) (Bell 1934, Roman 1984, pp. 63-67) is a ...

The most common form of cosine integral is Ci(x) = -int_x^infty(costdt)/t (1) = gamma+lnx+int_0^x(cost-1)/tdt (2) = 1/2[Ei(ix)+Ei(-ix)] (3) = -1/2[E_1(ix)+E_1(-ix)], (4) ...

A hypergeometric identity discovered by Ramanujan around 1910. From Hardy (1999, pp. 13 and 102-103), (1) where a^((n))=a(a+1)...(a+n-1) (2) is the rising factorial (a.k.a. ...

One of the numbers ..., -2, -1, 0, 1, 2, .... The set of integers forms a ring that is denoted Z. A given integer n may be negative (n in Z^-), nonnegative (n in Z^*), zero ...

An L-algebraic number is a number theta in (0,1) which satisfies sum_(k=0)^nc_kL(theta^k)=0, (1) where L(x) is the Rogers L-function and c_k are integers not all equal to 0 ...