SimpleS

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 $k^d$ 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 $k^d$ subdivision, and is considerably simpler than the {ssf RedRefinementND} algorithm for implementation of Freudenthal’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. (Source: http://dl.acm.org/)

This software is also peer reviewed by journal TOMS.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 4 articles , 1 standard article )

Showing results 1 to 4 of 4.
Sorted by year (citations)

  1. Xuan, Zhaocheng; Papadopoulos, Panayiotis: Computing an upper bound on contact stress with surrogate duality (2016)
  2. Žilinskas, Antanas; Žilinskas, Julius: P-algorithm based on a simplicial statistical model of multimodal functions (2010)
  3. Guimarães, Frederico G.; Palhares, Reinaldo M.; Campelo, Felipe; Igarashi, Hajime: Design of mixed (\mathcalH_2/\mathcalH_\infty) control systems using algorithms inspired by the immune system (2007)
  4. Gonçalves, Eduardo N.; Palhares, Reinaldo M.; Takahashi, Ricardo H. C.; Mesquita, Renato C.: Algorithm 860: SimpleS -- an extension of Freudenthal’s simplex subdivision. (2006)