论文信息 - Hamiltonian triangulations of Rn

Hamiltonian triangulations of Rn

We show that two well-known triangulations of Rn can be enumerated so that successive simplices are adjacent. As an application, we obtain efficient ways to search for initial completely labelled simplices in simplicial algorithms for nonlinear eigenvalue problems.

M. Todd

[1] H. Whitney. Geometric Integration Theory , 1957 .

[2] O. Zienkiewicz. The Finite Element Method In Engineering Science , 1971 .

[3] A. Stroud. Approximate calculation of multiple integrals , 1973 .

[4] M. Todd. The Computation of Fixed Points and Applications , 1976 .

[5] C. B. García,et al. Fixed points : algorithms and applications , 1977 .

[6] M. Todd. Union Jack Triangulations , 1977 .

[7] E. Reingold,et al. Combinatorial Algorithms: Theory and Practice , 1977 .

[8] Eugene L. Allgower,et al. Triangulations by Reflections with Applications to Approximation , 1978 .

[9] E. Allgower,et al. Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations , 1980 .