Search Results for ""

The Schläfli graph is a strongly regular graph on 27 nodes which is the graph complement of the generalized quadrangle GQ(2,4). It is the unique strongly regular graph with ...

The Brouwer-Haemers graph is the unique strongly regular graph on 81 vertices with parameters nu=81, k=20, lambda=1, mu=6 (Brouwer and Haemers 1992, Brouwer). It is also ...

The conjugate gradient method can be applied on the normal equations. The CGNE and CGNR methods are variants of this approach that are the simplest methods for nonsymmetric ...

In the biconjugate gradient method, the residual vector r^((i)) can be regarded as the product of r^((0)) and an ith degree polynomial in A, i.e., r^((i))=P_i(A)r^((0)). (1) ...

The proposal originally made by Georg Cantor that there is no infinite set with a cardinal number between that of the "small" infinite set of integers aleph_0 and the "large" ...

The word "convergent" has a number of different meanings in mathematics. Most commonly, it is an adjective used to describe a convergent sequence or convergent series, where ...

Two nonisomorphic graphs can share the same graph spectrum, i.e., have the same eigenvalues of their adjacency matrices. Such graphs are called cospectral. For example, the ...

The Fibonacci cube graph of order n is a graph on F_(n+2) vertices, where F_n is a Fibonacci number, labeled by the Zeckendorf representations of the numbers 0 to F_(n+2)-1 ...

Let |A| denote the cardinal number of set A, then it follows immediately that |A union B|=|A|+|B|-|A intersection B|, (1) where union denotes union, and intersection denotes ...

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