Search Results for ""

If W is a k-dimensional subspace of a vector space V with inner product <,>, then it is possible to project vectors from V to W. The most familiar projection is when W is the ...

An algorithm for computing the eigenvalues and eigenvectors for large symmetric sparse matrices.

A number triangle of order n with entries 1 to n such that entries are nondecreasing across rows and down columns and all entries in column j are less than or equal to j. An ...

The group of all nonsingular n×n stochastic matrices over a field F. It is denoted S(n,F). If p is prime and F is the finite field of order q=p^m, S(n,q) is written instead ...

The notion of an inverse is used for many types of mathematical constructions. For example, if f:T->S is a function restricted to a domain S and range T in which it is ...

The bipartite double graph, also called the Kronecker cover, Kronecker double cover, bipartite double cover, canonical double cover, or bipartite double, of a given graph G ...

The conjugate gradient method is not suitable for nonsymmetric systems because the residual vectors cannot be made orthogonal with short recurrences, as proved in Voevodin ...

Covariance provides a measure of the strength of the correlation between two or more sets of random variates. The covariance for two random variates X and Y, each with sample ...

The graph sum of graphs G and H is the graph with adjacency matrix given by the sum of adjacency matrices of G and H. A graph sum is defined when the orders of G and H are ...

A projection of a figure by parallel rays. In such a projection, tangencies are preserved. Parallel lines project to parallel lines. The ratio of lengths of parallel segments ...