Search Results for ""

A generalized hypergeometric function _pF_q[alpha_1,alpha_2,...,alpha_p; beta_1,beta_2,...,beta_q;z], is said to be k-balanced if sum_(i=1)^qbeta_i=k+sum_(i=1)^palpha_i.

The function defined by [n]_q = [n; 1]_q (1) = (1-q^n)/(1-q) (2) for integer n, where [n; k]_q is a q-binomial coefficient. The q-bracket satisfies lim_(q->1^-)[n]_q=n. (3)

The product C of two matrices A and B is defined as c_(ik)=a_(ij)b_(jk), (1) where j is summed over for all possible values of i and k and the notation above uses the ...

The downward Clenshaw recurrence formula evaluates a sum of products of indexed coefficients by functions which obey a recurrence relation. If f(x)=sum_(k=0)^Nc_kF_k(x) (1) ...

A hypergeometric series sum_(k)c_k is a series for which c_0=1 and the ratio of consecutive terms is a rational function of the summation index k, i.e., one for which ...

A lozenge (or rhombus) algorithm is a class of transformation that can be used to attempt to produce series convergence improvement (Hamming 1986, p. 207). The best-known ...

The q-analog of the binomial theorem (1-z)^n=1-nz+(n(n-1))/(1·2)z^2-(n(n-1)(n-2))/(1·2·3)z^3+... (1) is given by (1-z/(q^n))(1-z/(q^(n-1)))...(1-z/q) ...

The improvement of the convergence properties of a series, also called convergence acceleration or accelerated convergence, such that a series reaches its limit to within ...

The Euler-Maclaurin integration and sums formulas can be derived from Darboux's formula by substituting the Bernoulli polynomial B_n(t) in for the function phi(t). ...

_3F_2[n,-x,-y; x+n+1,y+n+1] =Gamma(x+n+1)Gamma(y+n+1)Gamma(1/2n+1)Gamma(x+y+1/2n+1) ×Gamma(n+1)Gamma(x+y+n+1)Gamma(x+1/2n+1)Gamma(y+1/2n+1), (1) where _3F_2(a,b,c;d,e;z) is a ...