Search Results for ""

Let A and B_j be sets. Conditional probability requires that P(A intersection B_j)=P(A)P(B_j|A), (1) where intersection denotes intersection ("and"), and also that P(A ...

Bisection is the division of a given curve, figure, or interval into two equal parts (halves). A simple bisection procedure for iteratively converging on a solution which is ...

A boundary value problem is a problem, typically an ordinary differential equation or a partial differential equation, which has values assigned on the physical boundary of ...

Brent's method is a root-finding algorithm which combines root bracketing, bisection, and inverse quadratic interpolation. It is sometimes known as the van ...

Consider a broadcast scheme on a connected graph from an originator vertex v in a graph G consisting of a sequence of parallel calls starting from v. In each time step, every ...

An algorithm which finds rational function extrapolations of the form R_(i(i+1)...(i+m))=(P_mu(x))/(P_nu(x))=(p_0+p_1x+...+p_mux^mu)/(q_0+q_1x+...+q_nux^nu) and can be used ...

A characteristic factor is a factor in a particular factorization of the totient function phi(n) such that the product of characteristic factors gives the representation of a ...

A number of spellings of "Chebyshev" (which is the spelling used exclusively in this work) are commonly found in the literature. These include Tchebicheff, Čebyšev, ...

Using a Chebyshev polynomial of the first kind T(x), define c_j = 2/Nsum_(k=1)^(N)f(x_k)T_j(x_k) (1) = 2/Nsum_(k=1)^(N)f[cos{(pi(k-1/2))/N}]cos{(pij(k-1/2))/N}. (2) Then f(x) ...

Given a symmetric positive definite matrix A, the Cholesky decomposition is an upper triangular matrix U with strictly positive diagonal entries such that A=U^(T)U. Cholesky ...