Search Results for ""

A pseudograph is a non-simple graph in which both graph loops and multiple edges are permitted (Zwillinger 2003, p. 220).

Given a matrix A, its QR-decomposition is a matrix decomposition of the form A=QR, where R is an upper triangular matrix and Q is an orthogonal matrix, i.e., one satisfying ...

A graph G that becomes disconnected when removing a suitable complete subgraph K, called a vertex cut, is said to be quasiseparable. The two simplest cases are those where K ...

A regular pyramid is a right pyramid whose base is a regular polygon. For a right pyramid of height h with a regular n-gonal base of side length a and circumradius R, the ...

Relaxation methods are methods of solving partial differential equations that involve splitting the sparse matrix that arises from finite differencing then iterating until a ...

The rhombic enneacontahedron is the equilateral zonohedron constructed from the 10 diameters of the dodecahedron. This enneacontahedron somewhat resembles a figure of Sharp ...

A zonohedron which can be derived from the rhombic triacontahedron by removing any one of the zones and bringing together the two pieces into which the remainder of the ...

The rhombicosahedron is the uniform polyhedron with Maeder index 56 (Maeder 1997), Wenninger index 96 (Wenninger 1989), Coxeter index 72 (Coxeter et al. 1954), and Har'El ...

par The rhombidodecadodecahedron is the uniform polyhedron with Maeder index 38 (Maeder 1997), Wenninger index 76 (Wenninger 1989), Coxeter index 48 (Coxeter et al. 1954), ...

The d-dimensional rigidity matrix M(G) of a graph G with vertex count n, edge count m in the variables v_i=(x_1,...,x_d) is the m×(dn) matrix with rows indexed by the edges ...