Search Results for ""

A technique for computing eigenfunctions and eigenvalues. It proceeds by requiring J=int_a^b[p(x)y_x^2-q(x)y^2]dx (1) to have a stationary value subject to the normalization ...

An idealized computing machine consisting of a fixed set of data registers and set of instructions for operating on them. Register machines are also known as counter machines ...

The regularized gamma functions are defined by P(a,z) = (gamma(a,z))/(Gamma(a)) (1) Q(a,z) = (Gamma(a,z))/(Gamma(a)), (2) where gamma(a,z) and Gamma(a,z) are incomplete gamma ...

Relaxation methods are methods of solving partial differential equations that involve splitting the sparse matrix that arises from finite differencing then iterating until a ...

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

Rodrigues' rotation formula gives an efficient method for computing the rotation matrix R in SO(3) corresponding to a rotation by an angle theta about a fixed axis specified ...

A powerful numerical integration technique which uses k refinements of the extended trapezoidal rule to remove error terms less than order O(N^(-2k)). The routine advocated ...

When computing the sample variance s numerically, the mean must be computed before s^2 can be determined. This requires storing the set of sample values. However, it is ...

An algorithm for multiplying two 32-bit integers modulo a 32-bit constant without using any intermediates larger than 32 bits. It is also useful in certain types of random ...

Searching refers to locating a given element or an element satisfying certain conditions from some (usually ordered or partially ordered) table, list, tree, etc.