Search Results for ""
231 - 240 of 1277 for Chebyshev PolynomialSearch Results
![](/common/images/search/spacer.gif)
The biconjugate gradient stabilized (BCGSTAB) method was developed to solve nonsymmetric linear systems while avoiding the often irregular convergence patterns of the ...
The conjugate gradient method can be applied on the normal equations. The CGNE and CGNR methods are variants of this approach that are the simplest methods for nonsymmetric ...
The Pell graph Pi_n is the graph defined as follows. Consider n-tuples of (0,1,2) such that maximal blocks of an odd number of 2's are forbidden. Take these as the vertices ...
In graph theory, a cycle graph C_n, sometimes simply known as an n-cycle (Pemmaraju and Skiena 2003, p. 248), is a graph on n nodes containing a single cycle through all ...
The angles mpi/n (with m,n integers) for which the trigonometric functions may be expressed in terms of finite root extraction of real numbers are limited to values of m ...
The Mangoldt function is the function defined by Lambda(n)={lnp if n=p^k for p a prime; 0 otherwise, (1) sometimes also called the lambda function. exp(Lambda(n)) has the ...
A spanning tree of a graph on n vertices is a subset of n-1 edges that form a tree (Skiena 1990, p. 227). For example, the spanning trees of the cycle graph C_4, diamond ...
The Bessel functions of the first kind J_n(x) are defined as the solutions to the Bessel differential equation x^2(d^2y)/(dx^2)+x(dy)/(dx)+(x^2-n^2)y=0 (1) which are ...
Legendre and Whittaker and Watson's (1990) term for the beta integral int_0^1x^p(1-x)^qdx, whose solution is the beta function B(p+1,q+1).
For R[n]>-1 and R[z]>0, Pi(z,n) = n^zint_0^1(1-x)^nx^(z-1)dx (1) = (n!)/((z)_(n+1))n^z (2) = B(z,n+1), (3) where (z)_n is the Pochhammer symbol and B(p,q) is the beta ...
![](/common/images/search/spacer.gif)
...