TOPICS
Search

Search Results for ""


5441 - 5450 of 9727 for Numbered Equation 2Search Results
Generalizes the secant method of root finding by using quadratic 3-point interpolation q=(x_n-x_(n-1))/(x_(n-1)-x_(n-2)). (1) Then define A = ...
A composition of a function f degreesf with itself gives a nested function f(f(x)), f degreesf degreesf which gives f(f(f(x)), etc. Function nesting is implemented in the ...
A hypergeometric class of orthogonal polynomials defined by R_n(lambda(x);alpha,beta,gamma,delta) =_4F_3(-n,n+alpha+beta+1,-x,x+gamma+delta+1; alpha+1,beta+delta+1,gamma+1;1) ...
For a delta function at (x_0,y_0), R(p,tau) = int_(-infty)^inftyint_(-infty)^inftydelta(x-x_0)delta(y-y_0)delta[y-(tau+px)]dydx (1) = ...
Given two distributions Y and X with joint probability density function f(x,y), let U=Y/X be the ratio distribution. Then the distribution function of u is D(u) = P(U<=u) (1) ...
Given a polynomial p(x)=a_nx^n+a_(n-1)x^(n-1)+...+a_1x+a_0 (1) of degree n with roots alpha_i, i=1, ..., n and a polynomial q(x)=b_mx^m+b_(m-1)x^(m-1)+...+b_1x+b_0 (2) of ...
The Riemann-Lebesgue Lemma, sometimes also called Mercer's theorem, states that lim_(n->infty)int_a^bK(lambda,z)Csin(nz)dz=0 (1) for arbitrarily large C and "nice" ...
The nth-order Sierpiński tetrahedron graph is the connectivity graph of black triangles in the nth iteration of the tetrix fractal. The first three iterations are shown ...
Let P(1/x) be a linear functional acting according to the formula <P(1/x),phi> = Pint(phi(x))/xdx (1) = ...
The group of all nonsingular n×n stochastic matrices over a field F. It is denoted S(n,F). If p is prime and F is the finite field of order q=p^m, S(n,q) is written instead ...
1 ... 542|543|544|545|546|547|548 ... 973 Previous Next

...