Search Results for ""

The longest path problem asks to find a path of maximum length in a given graph. The problem is NP-complete, but there exists an efficient dynamic programming solution for ...

A minor M_(ij) is the reduced determinant of a determinant expansion that is formed by omitting the ith row and jth column of a matrix A. So, for example, the minor M_(22) of ...

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 ...

Differential entropy differs from normal or absolute entropy in that the random variable need not be discrete. Given a continuous random variable X with a probability density ...

The Laplacian polynomial is the characteristic polynomial of the Laplacian matrix. The second smallest root of the Laplacian polynomial of a graph g (counting multiple values ...

The distance d(u,v) between two vertices u and v of a finite graph is the minimum length of the paths connecting them (i.e., the length of a graph geodesic). If no such path ...

The curve defined by the Cartesian equation f(x)=ln|(sinx)/x|=ln|sinc(x)|. The Kilroy curve arises in the study of spread spectra plotted on a logarithmic (decibel) scale, ...

A hyperbolic linear map R^n->R^n with integer entries in the transformation matrix and determinant +/-1 is an Anosov diffeomorphism of the n-torus, called an Anosov ...

Let A be a matrix and x and b vectors. Then the system Ax=b, x>=0 has no solution iff the system A^(T)y>=0, b^(T)y<0 has a solution, where y is a vector (Fang and Puthenpura ...

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 ...