Search Results for ""

Let the true value of a quantity be x and the measured or inferred value x_0. Then the relative error is defined by deltax=(Deltax)/x=(x_0-x)/x=(x_0)/x-1, where Deltax is the ...

S_n(z) = zj_n(z)=sqrt((piz)/2)J_(n+1/2)(z) (1) C_n(z) = -zn_n(z)=-sqrt((piz)/2)N_(n+1/2)(z), (2) where j_n(z) and n_n(z) are spherical Bessel functions of the first and ...

The integral int_0^thetae^(-xsecphi)dphi.

A relation R on a set S is symmetric provided that for every x and y in S we have xRy iff yRx. The symmetric relations on n nodes are isomorphic with the rooted graphs on n ...

Let rho be a reciprocal difference. Then Thiele's interpolation formula is the continued fraction f(x)=f(x_1)+(x-x_1)/(rho(x_1,x_2)+)(x-x_2)/(rho_2(x_1,x_2,x_3)-f(x_1)+) ...

A C-matrix is a symmetric (C^(T)=C) or antisymmetric (C^(T)=-C) C_n (-1,0,1)-matrix with diagonal elements 0 and others +/-1 that satisfies CC^(T)=(n-1)I, (1) where I is the ...

A tree with its nodes labeled. The number of labeled trees on n nodes is n^(n-2), the first few values of which are 1, 1, 3, 16, 125, 1296, ... (OEIS A000272). Cayley (1889) ...

A minimal cover is a cover for which removal of any single member destroys the covering property. For example, of the five covers of {1,2}, namely {{1},{2}}, {{1,2}}, ...

Newton's method for finding roots of a complex polynomial f entails iterating the function z-[f(z)/f^'(z)], which can be viewed as applying the Euler backward method with ...

A very general theorem that allows the number of discrete combinatorial objects of a given type to be enumerated (counted) as a function of their "order." The most common ...