Search Results for ""

The ABC (atom-bond connectivity) energy of a graph is defined as the graph energy of its ABC matrix, i.e., the sum of the absolute values of the eigenvalues of its ABC matrix.

The digraph union of two digraphs is the digraph whose vertex set (respectively, edge set) is the union of their vertex sets (respectively, edge sets). Given a positive ...

Let the elements in a payoff matrix be denoted a_(ij), where the is are player A's strategies and the js are player B's strategies. Player A can get at least min_(j<=n)a_(ij) ...

A fixed point for which the stability matrix has equal negative eigenvalues.

The conjugate gradient method can be viewed as a special variant of the Lanczos method for positive definite symmetric systems. The minimal residual method (MINRES) and ...

A method of computing the determinant of a square matrix due to Charles Dodgson (1866) (who is more famous under his pseudonym Lewis Carroll). The method is useful for hand ...

A method for finding a matrix inverse. To apply Gauss-Jordan elimination, operate on a matrix [A I]=[a_(11) ... a_(1n) 1 0 ... 0; a_(21) ... a_(2n) 0 1 ... 0; | ... | | | ... ...

An invertible linear transformation T:V->W is a map between vector spaces V and W with an inverse map which is also a linear transformation. When T is given by matrix ...

Any square matrix T has a canonical form without any need to extend the field of its coefficients. For instance, if the entries of T are rational numbers, then so are the ...

A fixed point for which the stability matrix has both eigenvalues of the same sign (i.e., both are positive or both are negative). If lambda_1<lambda_2<0, then the node is ...