Search Results for ""

A convex polyhedron can be defined algebraically as the set of solutions to a system of linear inequalities mx<=b, where m is a real s×3 matrix and b is a real s-vector. ...

The Fuhrmann triangle of a reference triangle DeltaABC is the triangle DeltaF_CF_BF_A formed by reflecting the mid-arc points arcM_A, arcM_B, arcM_C about the lines AB, AC, ...

The bandwidth of a connected graph G is the minimum matrix bandwidth among all possible adjacency matrices of graphs isomorphic to G. Equivalently, it is the minimum graph ...

Given a triangle DeltaABC and the excentral triangle DeltaJ_AJ_BJ_C, define the A^'-vertex of the hexyl triangle as the point in which the perpendicular to AB through the ...

Given a point P, the pedal triangle of P is the triangle whose polygon vertices are the feet of the perpendiculars from P to the side lines. The pedal triangle of a triangle ...

The triangle DeltaA^*B^*C^* obtained by reflecting the vertices of a reference triangle DeltaABC about the opposite sides is called the reflection triangle (Grinberg 2003). ...

A simple directed graph is a directed graph having no multiple edges or graph loops (corresponding to a binary adjacency matrix with 0s on the diagonal). The number of simple ...

Stationary iterative methods are methods for solving a linear system of equations Ax=b, where A is a given matrix and b is a given vector. Stationary iterative methods can be ...

The Minkowski metric, also called the Minkowski tensor or pseudo-Riemannian metric, is a tensor eta_(alphabeta) whose elements are defined by the matrix (eta)_(alphabeta)=[-1 ...

Chebyshev iteration is a method for solving nonsymmetric problems (Golub and van Loan 1996, §10.1.5; Varga, 1962, Ch. 5). Chebyshev iteration avoids the computation of inner ...