Search Results for ""

The extended mean-value theorem (Anton 1984, pp. 543-544), also known as the Cauchy mean-value theorem (Anton 1984, pp. 543) and Cauchy's mean-value formula (Apostol 1967, p. ...

Let f(z) = z+a_1+a_2z^(-1)+a_3z^(-2)+... (1) = zsum_(n=0)^(infty)a_nz^(-n) (2) = zg(1/z) (3) be a Laurent polynomial with a_0=1. Then the Faber polynomial P_m(f) in f(z) of ...

A formula for numerical integration, (1) where C_(2n) = sum_(i=0)^(n)f_(2i)cos(tx_(2i))-1/2[f_(2n)cos(tx_(2n))+f_0cos(tx_0)] (2) C_(2n-1) = ...

An extension field F subset= K is called finite if the dimension of K as a vector space over F (the so-called degree of K over F) is finite. A finite field extension is ...

Suppose f(x) is continuous at a stationary point x_0. 1. If f^'(x)>0 on an open interval extending left from x_0 and f^'(x)<0 on an open interval extending right from x_0, ...

Let J_A, J_B, and J_C be the vertices of the outer Soddy triangle, and also let E_A, E_B, and E_C be the pairwise contact points of the three tangent circles. Then the lines ...

The first Fermat point X (or F_1) (sometimes simply called "the Fermat point," Torricelli point, or first isogonic center) is the point X which minimizes the sum of distances ...

Let X(x)=X(x_1,x_2,...,x_n) be a random vector in R^n and let f_X(x) be a probability distribution on X with continuous first and second order partial derivatives. The Fisher ...

Simply stated, floating-point arithmetic is arithmetic performed on floating-point representations by any number of automated devices. Traditionally, this definition is ...

The forward difference is a finite difference defined by Deltaa_n=a_(n+1)-a_n. (1) Higher order differences are obtained by repeated operations of the forward difference ...