Search Results for ""

The biconjugate gradient stabilized (BCGSTAB) method was developed to solve nonsymmetric linear systems while avoiding the often irregular convergence patterns of the ...

Consider a Boolean algebra of subsets b(A) generated by a set A, which is the set of subsets of A that can be obtained by means of a finite number of the set operations ...

The figure determined by four lines, no three of which are concurrent, and their six points of intersection (Johnson 1929, pp. 61-62). Note that this figure is different from ...

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

A connex is a geometric form introduced by Clebsch (1872) that included as special cases the curve considered as a point locus and the curve considered as a line envelope ...

The cricket graph is the 5-vertex graph illustrated above. It is implemented in the Wolfram Language as GraphData["CricketGraph"].

The dart graph is the 5-vertex graph illustrated above. It is implemented in the Wolfram Language as GraphData["DartGraph"].

The diamond graph is the simple graph on 4 nodes and 5 edges illustrated above (Brandstädt et al. 1987, p. 18). It is isomorphic to the complete tripartite graph K_(1,1,2) ...

The Eiffel Tower graph is the graph on 7 vertices illustrated above. (Note that Koren et al. (2003) use the term 'Eiffel Tower graph' to refer instead to the (3,2)-fan ...

Ergodic theory can be described as the statistical and qualitative behavior of measurable group and semigroup actions on measure spaces. The group is most commonly N, R, R-+, ...