Search Results for ""

One of the "knots" t_(p+1), ..., t_(m-p-1) of a B-spline with control points P_0, ..., P_n and knot vector T={t_0,t_1,...,t_m}, where p=m-n-1.

The use of three prior points in a root-finding algorithm to estimate the zero crossing.

The substitution of re^(itheta) for z in a polynomial p(z). p(z) is then plotted as a function of theta for a given r in the complex plane. By varying r so that the curve ...

A generalization of the Runge-Kutta method for solution of ordinary differential equations, also called Rosenbrock methods.

Coefficients which appear in Lagrange interpolating polynomials where the points are equally spaced along the abscissa.

A root-finding algorithm also called Bailey's method and Hutton's method. For a function of the form g(x)=x^d-r, Lambert's method gives an iteration function ...

An algorithm which isolates roots in the complex plane by generalizing one-dimensional bracketing.

A wavelet used in multiresolution representation to analyze the information content of images. The wavelet is defined by ...

An algorithm for finding roots for quartic equations with complex roots.

A Müntz space is a technically defined space M(Lambda)=span{x^(lambda_0),x^(lambda_1),...} which arises in the study of function approximations.