TOPICS
Search

Search Results for ""


631 - 640 of 1103 for Sylvester matrixSearch Results
A planar straight line embedding of a planar graph is a planar embedding in which only straight line segments are used to connect the graph vertices. Fáry (1948) showed that ...
A left eigenvector is defined as a row vector X_L satisfying X_LA=lambda_LX_L. In many common applications, only right eigenvectors (and not left eigenvectors) need be ...
If two square n×n matrices A and B are simultaneously upper triangularizable by similarity transforms, then there is an ordering a_1, ..., a_n of the eigenvalues of A and ...
The eigenvalues lambda satisfying P(lambda)=0, where P(lambda) is the characteristic polynomial, lie in the unions of the disks |z|<=1 |z+b_1|<=sum_(j=1)^n|b_j|.
A right eigenvector is defined as a column vector X_R satisfying AX_R=lambda_RX_R. In many common applications, only right eigenvectors (and not left eigenvectors) need be ...
A scalar is a one-component quantity that is invariant under rotations of the coordinate system.
A system is singular if its condition number is infinite and ill-conditioned if it is too large.
A linear transformation between two vector spaces V and W is a map T:V->W such that the following hold: 1. T(v_1+v_2)=T(v_1)+T(v_2) for any vectors v_1 and v_2 in V, and 2. ...
In general, a topological index, sometimes also known as a graph-theoretic index, is a numerical invariant of a chemical graph (Plavšić et al. 1993). Particular topological ...
Given a function f(x) of a variable x tabulated at m values y_1=f(x_1), ..., y_m=f(x_m), assume the function is of known analytic form depending on n parameters ...
1 ... 61|62|63|64|65|66|67 ... 111 Previous Next

...