Search Results for ""

The mathematical study of abstract computing machines (especially Turing machines) and the analysis of algorithms used by such machines. A connection between automata theory ...

A method which can be used to solve some classes of integral equations and is especially useful in implementing certain types of data inversion. It has been applied to invert ...

The apodization function f(x)=1-(|x|)/a (1) which is a generalization of the one-argument triangle function. Its full width at half maximum is a. It has instrument function ...

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 ...