TOPICS
Search

Search Results for ""


291 - 300 of 1392 for linear programmingSearch Results
An equation of the form f(x)=b (mod m), (1) where the values of 0<=x<m for which the equation holds are sought. Such an equation may have none, one, or many solutions. There ...
The ratio C of the largest to smallest singular value in the singular value decomposition of a matrix. The base-b logarithm of C is an estimate of how many base-b digits are ...
The Killing form is an inner product on a finite dimensional Lie algebra g defined by B(X,Y)=Tr(ad(X)ad(Y)) (1) in the adjoint representation, where ad(X) is the adjoint ...
Let A be an involutive algebra over the field C of complex numbers with involution xi|->xi^♭. Then A is a right Hilbert algebra if A has an inner product <·,·> satisfying: 1. ...
The inverse of a square matrix A, sometimes called a reciprocal matrix, is a matrix A^(-1) such that AA^(-1)=I, (1) where I is the identity matrix. Courant and Hilbert (1989, ...
Cartesian coordinates are rectilinear two- or three-dimensional coordinates (and therefore a special case of curvilinear coordinates) which are also called rectangular ...
One of the most useful tools in nonstandard analysis is the concept of a hyperfinite set. To understand a hyperfinite set, begin with an arbitrary infinite set X whose ...
A Gröbner basis G for a system of polynomials A is an equivalence system that possesses useful properties, for example, that another polynomial f is a combination of those in ...
Let A be an involutive algebra over the field C of complex numbers with involution xi|->xi^♯. Then A is a modular Hilbert algebra if A has an inner product <··> and a ...
If V and W are Banach spaces and T:V->W is a bounded linear operator, the T is said to be a compact operator if it maps the unit ball of V into a relatively compact subset of ...
1 ... 27|28|29|30|31|32|33 ... 140 Previous Next

...