Abstract
Linear transformations of the Freudenthal triangulation with permutation congruent simplexes are characterized, and within this class those transformations yielding minimum normalized surface density are identified.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
B.C. Eaves and R. Saigal, “Homotopies for computation of fixed points on unbounded regions”,Mathematical Programming 3 (1972) 225–237.
B.C. Eaves and J. Yorke, “Equivalence of surface density and average directional density”, to appear inMathematics of Operations Research.
H. Freudenthal, “Simplizialzerlegungen von beschränkter Flachheit”,Annals of Mathematics 43 (1942) 580–582.
T. Hansen, “On the approximation of a competitive equilibrium”, Ph.D. Dissertation, Department of Economics, Yale University (1968).
H.W. Kuhn, “Simplicial approximation of fixed points”,Proceedings National Academy of Sciences, U.S.A. 61 (1968) 1238–1242.
G. van der Laan and A.J.J. Talman, “A restart algorithm for computing fixed points without an extra dimension”,Mathematical Programming 17 (1979) 74–84.
G. van der Laan and A.J.J. Talman, “An improvement, of fixed point algorithms by using a good triangulation”,Mathematical Programming 18 (1980) 274–285.
O.H. Merrill, “Applications and extensions of an algorithm that computes fixed points of certain upper semi-continuous point to set mapping”, Ph.D. Dissertation, Department of Industrial Engineering, University of Michigan, Ann Arbor, MI (1972).
A.N. Netravali and R. Saigal, “Optimum quantizer design using a fixed-point algorithm”,The Bell System Technical Journal 55 (1976) 1423–1435.
R. Saigal, “Investigations into the efficiency of fixed point algorithms”, in: S. Karamardian, ed.,Fixed points: Algorithms and applications (Academic Press, New York, 1977) 203–223.
R. Saigal, D. Solow and L. Wolsey, “A comparative study of two algorithms that compute fixed points in unbounded regions”, Presented at the 8th International Symposium on Mathematical Programming, Stanford University, California (August 1973).
R. Saigal and M.J. Todd, “Efficient acceleration techniques for fixed point algorithms”,SIAM Journal on Numerical Analysis 15 (1978) 997–1007.
S. Shamir, “Fixed-point computational methods—Some new high performance triangulations and algorithms”, Ph.D. Dissertation., Department of Engineering-Economic Systems, Stanford University, Stanford, California (October 1979).
A.J.J. Talman, with the collaboration of G. van der Laan,Variable dimension fixed point algorithms and triangulations (Mathematical Centre, Amsterdam, 1980).
M.J. Todd, “On triangulations for computing fixed points”,Mathematical Programming 10 (1976) 322–346.
M.J. Todd, “Union jack triangulations”, in: S. Karamardian, ed.,Fixed points: Algorithms and applications (Academic Press, New York, 1977) 315–336.
M.J. Todd, “Improving the convergence of fixed point algorithms”,Mathematical Programming Study 7 (1978) 151–169.
A.H. Wright, “The octahedral algorithm. A new simplicial fixed point algorithms”,Mathemtical Programming 21 (1981) 47–69.
M.J. Todd, “Solutions to certain matrix optimization problems”, Technical Report No. 584, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY (1983).
Author information
Authors and Affiliations
Additional information
This research was partially supported by National Science Foundation Grants SOC 78-16811 and MCS 81-21838; and Department of Energy Contract AM03- 76F00326, PA# DE-AT03-76ER72018.
Rights and permissions
About this article
Cite this article
Eaves, B.C. Permutation congruent transformations of the freudenthal triangulation with minimum surface density. Mathematical Programming 29, 77–99 (1984). https://doi.org/10.1007/BF02591731
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02591731