TOPICS
Search

Search Results for ""


831 - 840 of 1392 for linear programmingSearch Results
An upper triangular matrix U is defined by U_(ij)={a_(ij) for i<=j; 0 for i>j. (1) Written explicitly, U=[a_(11) a_(12) ... a_(1n); 0 a_(22) ... a_(2n); | | ... |; 0 0 ... ...
A square matrix with nonzero elements only on the diagonal and slots horizontally or vertically adjacent the diagonal (i.e., along the subdiagonal and superdiagonal), [a_(11) ...
A triangular matrix U of the form U_(ij)={a_(ij) for i<=j; 0 for i>j. (1) Written explicitly, U=[a_(11) a_(12) ... a_(1n); 0 a_(22) ... a_(2n); | | ... |; 0 0 ... a_(nn)]. ...
Delta(x_1,...,x_n) = |1 x_1 x_1^2 ... x_1^(n-1); 1 x_2 x_2^2 ... x_2^(n-1); | | | ... |; 1 x_n x_n^2 ... x_n^(n-1)| (1) = product_(i,j; i>j)(x_i-x_j) (2) (Sharpe 1987). For ...
Let X=(X,tau) be a topological vector space whose continuous dual X^* may or may not separate points (i.e., may or may not be T2). The weak-* (pronounced "weak star") ...
On July 10, 2003, Eric Weisstein computed the numbers of n×n (0,1)-matrices all of whose eigenvalues are real and positive, obtaining counts for n=1, 2, ... of 1, 3, 25, 543, ...
Differential Equations
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 class of all regular sequences of particularly well-behaved functions equivalent to a given regular sequence. A distribution is sometimes also called a "generalized ...
An n×n complex matrix A is called positive definite if R[x^*Ax]>0 (1) for all nonzero complex vectors x in C^n, where x^* denotes the conjugate transpose of the vector x. In ...
1 ... 81|82|83|84|85|86|87 ... 140 Previous Next

...