Search Results for ""

This is sometimes knows as the "bars and stars" method. Suppose a recipe called for 5 pinches of spice, out of 9 spices. Each possibility is an arrangement of 5 spices ...

Gauss's forward formula is f_p=f_0+pdelta_(1/2)+G_2delta_0^2+G_3delta_(1/2)^3+G_4delta_0^4+G_5delta_(1/2)^5+..., (1) for p in [0,1], where delta is the central difference and ...

Hermite-Gauss quadrature, also called Hermite quadrature, is a Gaussian quadrature over the interval (-infty,infty) with weighting function W(x)=e^(-x^2) (Abramowitz and ...

Let l(x) be an nth degree polynomial with zeros at x_1, ..., x_n. Then the fundamental Hermite interpolating polynomials of the first and second kinds are defined by ...

A root-finding algorithm based on the iteration formula x_(n+1)=x_n-(f(x_n))/(f^'(x_n)){1+(f(x_n)f^('')(x_n))/(2[f^'(x_n)]^2)}. This method, like Newton's method, has poor ...

A complicated polynomial root-finding algorithm which is used in the IMSL® (IMSL, Houston, TX) library and which Press et al. (1992) describe as "practically a standard in ...

An algorithm for finding roots which retains that prior estimate for which the function value has opposite sign from the function value at the current best estimate of the ...

Given a sequence {a_i}_(i=1)^N, an n-moving average is a new sequence {s_i}_(i=1)^(N-n+1) defined from the a_i by taking the arithmetic mean of subsequences of n terms, ...

A theory of constructing initial conditions that provides safe convergence of a numerical root-finding algorithm for an equation f(z)=0. Point estimation theory treats ...

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