Search Results for ""

The usual number of scalar operations (i.e., the total number of additions and multiplications) required to perform n×n matrix multiplication is M(n)=2n^3-n^2 (1) (i.e., n^3 ...

The conjugate gradient method is an algorithm for finding the nearest local minimum of a function of n variables which presupposes that the gradient of the function can be ...

A root-finding method which was among the most popular methods for finding roots of univariate polynomials in the 19th and 20th centuries. It was invented independently by ...

The Lagrange interpolating polynomial is the polynomial P(x) of degree <=(n-1) that passes through the n points (x_1,y_1=f(x_1)), (x_2,y_2=f(x_2)), ..., (x_n,y_n=f(x_n)), and ...

The roots (sometimes also called "zeros") of an equation f(x)=0 are the values of x for which the equation is satisfied. Roots x which belong to certain sets are usually ...

A congruence of the form f(x)=0 (mod n) where f(x) is an integer polynomial (Nagell 1951, p. 73).

The study of the nature and properties of bifurcations.

A numerical knot invariant. For a tame knot K, the bridge index is the least bridge number of all planar representations of the knot. The bridge index of the unknot is ...

sum_(k=0)^m(phi_k(x)phi_k(y))/(gamma_k)=(phi_(m+1)(x)phi_m(y)-phi_m(x)phi_(m+1)(y))/(a_mgamma_m(x-y),) (1) where phi_k(x) are orthogonal polynomials with weighting function ...

The computation of a derivative.