Search Results for ""

The graph distance matrix, sometimes also called the all-pairs shortest path matrix, is the square matrix (d_(ij)) consisting of all graph distances from vertex v_i to vertex ...

A monotonic matrix of order n is an n×n matrix in which every element is either 0 or contains a number from the set {1,...,n} subject to the conditions 1. The filled-in ...

A relation R on a set S is symmetric provided that for every x and y in S we have xRy iff yRx. The symmetric relations on n nodes are isomorphic with the rooted graphs on n ...

A strictly upper triangular matrix is an upper triangular matrix having 0s along the diagonal as well as the lower portion, i.e., a matrix A=[a_(ij)] such that a_(ij)=0 for ...

The invertible matrix theorem is a theorem in linear algebra which gives a series of equivalent conditions for an n×n square matrix A to have an inverse. In particular, A is ...

Householder (1953) first considered the matrix that now bears his name in the first couple of pages of his book. A Householder matrix for a real vector v can be implemented ...

A completely positive matrix is a real n×n square matrix A=(a_(ij)) that can be factorized as A=BB^(T), where B^(T) stands for the transpose of B and B is any (not ...

Given a reference triangle DeltaABC, the trilinear vertex matrix of another triangle DeltaA^'B^'C^' is the 3×3 matrix whose rows are the trilinear coordinates of the vertices ...

Two points z and z^S in C^* are symmetric with respect to a circle or straight line L if all circles and straight lines passing through z and z^S are orthogonal to L. Möbius ...

A matrix whose elements may contain complex numbers. The matrix product of two 2×2 complex matrices is given by (1) where R_(11) = ...