TOPICS
Search

Search Results for ""


811 - 820 of 1392 for linear programmingSearch Results
An operator A:f^((n))(I)|->f(I) assigns to every function f in f^((n))(I) a function A(f) in f(I). It is therefore a mapping between two function spaces. If the range is on ...
An ordinary differential equation (frequently called an "ODE," "diff eq," or "diffy Q") is an equality involving a function and its derivatives. An ODE of order n is an ...
The orthogonal decomposition of a vector y in R^n is the sum of a vector in a subspace W of R^n and a vector in the orthogonal complement W^_|_ to W. The orthogonal ...
A relation "<=" is a partial order on a set S if it has: 1. Reflexivity: a<=a for all a in S. 2. Antisymmetry: a<=b and b<=a implies a=b. 3. Transitivity: a<=b and b<=c ...
A permutation matrix is a matrix obtained by permuting the rows of an n×n identity matrix according to some permutation of the numbers 1 to n. Every row and column therefore ...
A square n×n matrix A=a_(ij) is called reducible if the indices 1, 2, ..., n can be divided into two disjoint nonempty sets i_1, i_2, ..., i_mu and j_1, j_2, ..., j_nu (with ...
The numerators and denominators obtained by taking the ratios of adjacent terms in the triangular array of the number of +1 "bordered" alternating sign matrices A_n with a 1 ...
Consider the characteristic equation |lambdaI-A|=lambda^n+b_1lambda^(n-1)+...+b_(n-1)lambda+b_n=0 (1) determining the n eigenvalues lambda of a real n×n square matrix A, ...
The p×p square matrix formed by setting s_(ij)=xi^(ij), where xi is a pth root of unity. The Schur matrix has a particularly simple determinant given by ...
If we expand the determinant of a matrix A using determinant expansion by minors, first in terms of the minors of order r formed from any r rows, with their complementaries, ...
1 ... 79|80|81|82|83|84|85 ... 140 Previous Next

...