Search Results for ""

There are several related theorems involving Hamiltonian cycles of graphs that are associated with Pósa. Let G be a simple graph with n graph vertices. 1. If, for every k in ...

The rising factorial x^((n)), sometimes also denoted <x>_n (Comtet 1974, p. 6) or x^(n^_) (Graham et al. 1994, p. 48), is defined by x^((n))=x(x+1)...(x+n-1). (1) This ...

The conjugate gradient method can be viewed as a special variant of the Lanczos method for positive definite symmetric systems. The minimal residual method and symmetric LQ ...

The Wiener-Hopf method is a powerful technique which enables certain linear partial differential equations subject to boundary conditions on semi-infinite domains to be ...

A q-analog, also called a q-extension or q-generalization, is a mathematical expression parameterized by a quantity q that generalizes a known expression and reduces to the ...

Analytic continuation (sometimes called simply "continuation") provides a way of extending the domain over which a complex function is defined. The most common application is ...

The inverse cotangent is the multivalued function cot^(-1)z (Zwillinger 1995, p. 465), also denoted arccotz (Abramowitz and Stegun 1972, p. 79; Harris and Stocker 1998, p. ...

A series of the form sum_(k=1)^infty(-1)^(k+1)a_k (1) or sum_(k=1)^infty(-1)^ka_k, (2) where a_k>0. A series with positive terms can be converted to an alternating series ...

If a sequence takes only a small number of different values, then by regarding the values as the elements of a finite field, the Berlekamp-Massey algorithm is an efficient ...

An adaptive Gaussian quadrature method for numerical integration in which error is estimation based on evaluation at special points known as "Kronrod points." By suitably ...