Search Results for ""
2881 - 2890 of 3574 for Inverse FunctionsSearch Results
Analytic representations the symmetric triangle wave with period 2 and varying between -1 and 1 include f(x) = 2/pisin^(-1)[sin(pix)] (1) = 1-2|1-[2(1/2x+1/4 (mod 1))]| (2) = ...
Let A be a C^*-algebra having no unit. Then A^~=A direct sum C as a vector spaces together with 1. (a,lambda)+(b,mu)=(a+b,lambda+mu). 2. mu(a,lambda)=(mua,mulambda). 3. ...
Consider three squares erected externally on the sides of a triangle DeltaABC. Call the centers of these squares O_A, O_B, and O_C, respectively. Then the lines AO_A, BO_B, ...
The matrix product of a square set of data d and a matrix of basis vectors consisting of Walsh functions. By taking advantage of the nested structure of the natural ordering ...
Let sum_(n=1)^(infty)u_n(x) be a series of functions all defined for a set E of values of x. If there is a convergent series of constants sum_(n=1)^inftyM_n, such that ...
Let all of the functions f_n(z)=sum_(k=0)^inftya_k^((n))(z-z_0)^k (1) with n=0, 1, 2, ..., be regular at least for |z-z_0|<r, and let F(z) = sum_(n=0)^(infty)f_n(z) (2) = (3) ...
The weighted mean of a discrete set of numbers {x_1,x_2,...,x_n} with weights {w_1,w_2,...,w_n} is given by <x>=sum_(i=1)^nw_ix_i, (1) where each weight w_i is a nonnegative ...
The orthogonal polynomials defined variously by (1) (Koekoek and Swarttouw 1998, p. 24) or p_n(x;a,b,c,d) = W_n(-x^2;a,b,c,d) (2) = (3) (Koepf, p. 116, 1998). The first few ...
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 ...
Given two additive groups (or rings, or modules, or vector spaces) A and B, the map f:A-->B such that f(a)=0 for all a in A is called the zero map. It is a homomorphism in ...
...
View search results from all Wolfram sites (501482 matches)

