Search Results for ""

Let L denote the partition lattice of the set {1,2,...,n}. The maximum element of L is M={{1,2,...,n}} (1) and the minimum element is m={{1},{2},...,{n}}. (2) Let Z_n denote ...

Consider a power series in a complex variable z g(z)=sum_(n=0)^inftya_nz^n (1) that is convergent within the open disk D:|z|<R. Convergence is limited to within D by the ...

The Riemann sphere, also called the extended complex plane, is a one-dimensional complex manifold C^* (C-star) which is the one-point compactification of the complex numbers ...

Two families of equations used to find roots of nonlinear functions of a single variable. The "B" family is more robust and can be used in the neighborhood of degenerate ...

A root-finding algorithm which assumes a function to be approximately linear in the region of interest. Each improvement is taken as the point where the approximating line ...

Given a Hilbert space H, the sigma-strong operator topology is the topology on the algebra L(H) of bounded operators from H to itself defined as follows: A sequence S_i of ...

The objective of global optimization is to find the globally best solution of (possibly nonlinear) models, in the (possible or known) presence of multiple local optima. ...

The conjugate gradient method is not suitable for nonsymmetric systems because the residual vectors cannot be made orthogonal with short recurrences, as proved in Voevodin ...

The Kaprekar routine is an algorithm discovered in 1949 by D. R. Kaprekar for 4-digit numbers, but which can be generalized to k-digit numbers. To apply the Kaprekar routine ...

Let a particle travel a distance s(t) as a function of time t (here, s can be thought of as the arc length of the curve traced out by the particle). The speed (the scalar ...