TOPICS
Search

Search Results for ""


11 - 20 of 198 for Chebyshev iterationSearch Results
The two functions theta(x) and psi(x) defined below are known as the Chebyshev functions. The function theta(x) is defined by theta(x) = sum_(k=1)^(pi(x))lnp_k (1) = ...
A modified set of Chebyshev polynomials defined by a slightly different generating function. They arise in the development of four-dimensional spherical harmonics in angular ...
(1-x^2)(d^2y)/(dx^2)-x(dy)/(dx)+alpha^2y=0 (1) for |x|<1. The Chebyshev differential equation has regular singular points at -1, 1, and infty. It can be solved by series ...
A sequence {a_j} of positive integers is called an iteration sequence if there exists a strictly increasing sequence {s_k} of positive integers such that a_1=s_1>=2 and ...
Mann's iteration is the dynamical system defined for a continuous function f:[0,1]->[0,1], x_n=1/nsum_(k=0)^(n-1)f(x_k) with x_0 in [0,1]. It can also be written ...
Newton's iteration is an algorithm for computing the square root sqrt(n) of a number n via the recurrence equation x_(k+1)=1/2(x_k+n/(x_k)), (1) where x_0=1. This recurrence ...
Wolfram's iteration is an algorithm for computing the square root of a rational number 1<=r<4 using properties of the binary representation of r. The algorithm begins with ...
max_(a<=x<=b){|f(x)-rho(x)|w(x)}.
A Gaussian quadrature-like formula for numerical estimation of integrals. It uses weighting function W(x)=1 in the interval [-1,1] and forces all the weights to be equal. The ...
Apply Markov's inequality with a=k^2 to obtain P[(x-mu)^2>=k^2]<=(<(x-mu)^2>)/(k^2)=(sigma^2)/(k^2). (1) Therefore, if a random variable x has a finite mean mu and finite ...
1|2|3|4|5 ... 20 Previous Next

...