Algorithm 860: SimpleS—An Extension of Freudenthal’s Simplex Subdivision

This article presents a simple efficient algorithm for the subdivision of a d-dimensional simplex in kd simplices, where k is any positive integer number. The algorithm is an extension of Freudenthal’s subdivision method. The proposed algorithm deals with the more general case of kd subdivision, and is considerably simpler than the RedRefinementND algorithm for implementation of Freuden-thal’s strategy. The proposed simplex subdivision algorithm is motivated by a problem in the field of robust control theory: the computation of a tight upper bound of a dynamical system performance index by means of a branch-and-bound algorithm