Search Results for ""

A Sheffer sequence for (1,f(t)) is called the associated sequence for f(t), and a sequence s_n(x) of polynomials satisfying the orthogonality conditions ...

The Fourier transform of the Heaviside step function H(x) is given by F_x[H(x)](k) = int_(-infty)^inftye^(-2piikx)H(x)dx (1) = 1/2[delta(k)-i/(pik)], (2) where delta(k) is ...

For s_1,s_2=+/-1, lim_(epsilon_1->0; epsilon_2->0)1/(x_1-is_1epsilon_1)1/(x_2-is_2epsilon_2) =[PV(1/(x_1))+ipis_1delta(x_1)][PV(1/(x_2))+ipis_2delta(x_2)] ...

Orthogonal polynomials are classes of polynomials {p_n(x)} defined over a range [a,b] that obey an orthogonality relation int_a^bw(x)p_m(x)p_n(x)dx=delta_(mn)c_n, (1) where ...

A diagonal matrix is a square matrix A of the form a_(ij)=c_idelta_(ij), (1) where delta_(ij) is the Kronecker delta, c_i are constants, and i,j=1, 2, ..., n, with no implied ...

The technique of extracting the content from geometric (tensor) equations by working in component notation and rearranging indices as required. Index gymnastics is a ...

The Fourier transform of the constant function f(x)=1 is given by F_x[1](k) = int_(-infty)^inftye^(-2piikx)dx (1) = delta(k), (2) according to the definition of the delta ...

A polynomial sequence p_n(x) is called the basic polynomial sequence for a delta operator Q if 1. p_0(x)=1, 2. p_n(0)=0 for all n>0, 3. Qp_n(x)=np_(n-1)(x). If p_n(x) is a ...

Let R(x) be the ramp function, then the Fourier transform of R(x) is given by F_x[R(x)](k) = int_(-infty)^inftye^(-2piikx)R(x)dx (1) = i/(4pi)delta^'(k)-1/(4pi^2k^2), (2) ...

An orthogonal coordinate system is a system of curvilinear coordinates in which each family of surfaces intersects the others at right angles. Orthogonal coordinates ...