Search Results for ""

Capable of taking on exactly one possible value.

The Euclidean algorithm, also called Euclid's algorithm, is an algorithm for finding the greatest common divisor of two numbers a and b. The algorithm can also be defined for ...

An independent vertex set of a graph G is a subset of the vertices such that no two vertices in the subset represent an edge of G. The figure above shows independent sets ...

Let x=[a_0;a_1,...]=a_0+1/(a_1+1/(a_2+1/(a_3+...))) (1) be the simple continued fraction of a "generic" real number x, where the numbers a_i are the partial denominator. ...

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

A fixed point for which the stability matrix has both eigenvalues negative, so lambda_1<lambda_2<0.

A fixed point for which the stability matrix has one zero eigenvector with negative eigenvalue lambda<0.

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

A fixed point for which the stability matrix has both eigenvalues positive, so lambda_1>lambda_2>0.

A fixed point for which the stability matrix has one zero eigenvector with positive eigenvalue lambda>0.