Regular simplex

Determine a regular simplex figure in a three-dimensional space such that the distance between vertices is 0.2 unit and one vertex is at the point (-1,2, -2). 

A null-dimensional simplex is brought down to a point that is in the center of the coordinate system. For k=l, a regular simplex is a straight line with two vertices-ends, which lies on x1 axis and has these coordinates +0.500 and-0.500. For k=2, coordinates of a simplex vertex may be either constructed graphically or calculated from formula (2.180). Three vertices of this simplex have these coordinates ... 

At c 4, the regular simplex is a tetrahedron where each vertex represents a straight component, an edge represents a binary system, and a face a ternary one. Points inside the tetrahedron correspond to quaternary systems. 

It has been explained that when testing mixture diagrams, factor space is usually a regular simplex with q-vertices in a q-1 dimension space. In such a case, the task of mathematical theory of experiments consists of determining in the given simplex the minimum possible number of points where the design points will be done and based on which coefficients of the polynomial that adequately describes system behavior will be determined. This problem, for the case when there are no limitations on ratios of individual components, as presented in the previous chapter, was solved by Scheffe in 1958 [5], However, a researcher may in practice often be faced with multicomponent mixtures where definite limitations are imposed on ratios of individual components ... 

Figure 5.11 Representation of the displacement to the great curvature domain. A, according to the greatest slope method B, according to the regular simplex method.

We define a regular simplex plan as an assembly of k+1 equidistant points for k= 1, the simplex is a segment for k= 2, it is a triangle for k= 3, we are faced with a regular tetrahedron, etc. Each simplex has a geometric centre placed at one point. 

If the dimensionless factors of an investigated process are distributed in a planning matrix (5.138) where Xj values are obtained using relation (5.139), then we can prove that the points of the matrix are organized as a regular simplex. Relation (5.140) corresponds to the distance from a point to its opposite face. 

The equilateral triangle and regular tetrahedron are described above as the domain of a mixture where all possible compositions of the components are allowed for are regular simplexes. (In the remainder of the see-tion, they are referred to as simplexes.) Sueh eireum-stances in which there are no composition restraints are rare in formulation. However, if each component is present at a minimum level, and no other constraints are imposed, then the domain is also a simplex. 

To define a regular simplex, the values of p and q should be chosen so that each vertex has the same euclidian distance to all other vertices. If this distance, for convenience, is set to d = 1, the values of p and q will be as described in Table 11.2. below. How these values have been determined is described below. 

The most commonly used equiradial design is with m = 6, which defines a regular hexagon, see Fig. 12.17b. Such a distribution of experimental points is also obtained when a regular simplex with two variables has reached an optimum domain and have encircled the optimum point. It is therefore possible to establish a response surface model from the simplex experiments and use the model to locate the optimum. 

Now, provided the selected portion of the factor space has the same shape as the whole of the factor space (i.e. it is a simplex), it is possible to use the same mathematical models and designs as we used previously to investigate it. We have seen that imposing only lower limits on the domain results only in a decrease in the extent of the experimental region and it still remains a regular simplex. 

At the start of the search ( + 1) points (i.e., in two-dimensional space, three points) are fixed so that they form the comers of a regular simplex. In the example of Figure 13-12, this is an equilateral triangle. The value of the function is then determined for each of these points, and the search is then begim according to the following rules ... 

Consiruclion of the initial simplex. If we represent the number of variables by k, the regular simplex is a regular hyper polyhedral of dimension k. with (A + 11 vertices. In table 20 we give the coordinates of the points of a simplex... 

The possible experimental domain is a regular simplex of dimension Iq I). For <7 = 3. the experimental domain is an equilateral triangle (Fig. 18) for g = 4. this domain is a regular tetrahedral. The coordinates representing the values... 

Preconcentration of Cr(VI) by solvent extraction was optimised using a regular simplex. 

---