Abstract
Simplicial variable dimension algorithms to compute fixed points on the unit simplex were initiated by Kuhn in [98]. Kuhn’s variable dimension algorithm subdivides the unit simplex according to the Q-triangulation and starts at one of vertices of the unit simplex. It generates a sequence of adjacent simplices with varying dimension and terminates as soon as an approximate solution is yielded. If the accuracy is not good enough, one can restart Kuhn’s variable dimension algorithm at one of the vertices of the unit simplex with a finer simplicial subdivision. However, it is obvious that Kuhn’s algorithm loses all information about the location of a solution obtained in the previous implementation when restarting. To overcome this drawback, van der Laan and Talman originated a new generation of simplicial variable dimension algorithms on the unit simplex in [108]. Van der Laan and Talman’s variable dimension algorithm also subdivides the unit simplex according to the Q-triangulation, but it can start at an arbitrary grid point. Van der Laan and Talman’s algorithm leaves this grid point along one out of n + 1 different rays. It also generates a sequence of adjacent simplices with varying dimension and terminates in case that an approximate solution is obtained. If the accuracy is not high enough, one can restart the algorithm at the grid point closest to the approximate solution obtained in the previous implementation.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Dang, C. (1995). The D1-Triangulation in Variable Dimension Algorithms on the Unit Simplex. In: Triangulations and Simplicial Methods. Lecture Notes in Economics and Mathematical Systems, vol 421. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-48775-0_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-48775-0_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58838-2
Online ISBN: 978-3-642-48775-0
eBook Packages: Springer Book Archive