Search Results for ""

The Remez algorithm (Remez 1934), also called the Remez exchange algorithm, is an application of the Chebyshev alternation theorem that constructs the polynomial of best ...

A method for solving ordinary differential equations using the formula y_(n+1)=y_n+hf(x_n,y_n), which advances a solution from x_n to x_(n+1)=x_n+h. Note that the method ...

A condition in numerical equation solving which states that, given a space discretization, a time step bigger than some computable quantity should not be taken. The condition ...

The consideration of the result of a numerical calculation as a function of an adjustable parameter (usually the step size). The function can then be fitted and evaluated at ...

An implicit method for solving an ordinary differential equation that uses f(x_n,y_n) in y_(n+1). In the case of a heat equation, for example, this means that a linear system ...

A general set of methods for integrating ordinary differential equations. Predictor-corrector methods proceed by extrapolating a polynomial fit to the derivative from the ...

A genetic algorithm is a class of adaptive stochastic optimization algorithms involving search and optimization. Genetic algorithms were first used by Holland (1975). The ...

The function Pi_(a,b)(x)=H(x-a)-H(x-b) which is equal to 1 for a<=x<=b and 0 otherwise. Here H(x) is the Heaviside step function. The special case Pi_(-1/2,1/2)(x) gives the ...

A method of numerically integrating ordinary differential equations by using a trial step at the midpoint of an interval to cancel out lower-order error terms. The ...

A self-avoiding walk in which steps may be to the left, right, or straight ahead after a vertical step, but only straight ahead or to the left after a horizontal step. A ...