On generalized bisection of n-simplices

A generalized procedure of bisection of n-simplices is introduced, where the bisection point can be an (almost) arbitrary point at one of the longest edges. It is shown that nested sequences of simplices generated by successive generalized bisection converge to a singleton, and an exact bound of the convergence speed in terms of diameter reduction is given. For regular simplices, which mark the worst case, the edge lengths of each worst and best simplex generated by successive bisection are given up to depth n. For n = 2 and 3, the sequence of worst case diameters is provided until it is halved.

[1]  A. Liu,et al.  On the shape of tetrahedra from bisection , 1994 .

[2]  Baker Kearfott.  A proof of convergence and an error bound for the method of bisection in ⁿ , 1978 .

[3]  Eugene L. Allgower,et al.  Continuation and path following , 1993, Acta Numerica.

[4]  K. Sikorski.  A three-dimensional analogue to the method of bisections for solving nonlinear equations , 1979 .

[5]  M. Rivara.  A grid generator based on 4‐triangles conforming mesh‐refinement algorithms , 1987 .

[6]  M. Rivara.  Algorithms for refining triangular grids suitable for adaptive and multigrid techniques , 1984 .

[7]  Glenn W. Graves,et al.  AN ALGORITHM FOR NONCONVEX PROGRAMMING , 1969 .

[8]  F. Stenger,et al.  A lower bound on the angles of triangles constructed by bisecting the longest side , 1975 .

[9]  Reiner Horst,et al.  An algorithm for nonconvex programming problems , 1976, Math. Program..

[10]  M. Stynes.  On faster convergence of the bisection method for certain triangles , 1979 .

[11]  E. Allgower,et al.  Numerical Continuation Methods , 1990 .

[12]  Kris Sikorski,et al.  A bisection method for systems of nonlinear equations , 1984, TOMS.

[13]  P. Pardalos,et al.  Handbook of global optimization , 1995 .

[14]  Frank Stenger,et al.  Computing the topological degree of a mapping inRn , 1975 .

[15]  Aimo A. Törn,et al.  Global Optimization , 1999, Science.

[16]  Reiner Horst.  A New Branch and Bound Approach for Concave Minimization Problems , 1975, Optimization Techniques.

[17]  B. Eaves.  A Course in Triangulations for Solving Equations with Deformations , 1984 .

[18]  Eugene L. Allgower,et al.  Numerical continuation methods - an introduction , 1990, Springer series in computational mathematics.

[19]  M. Rivara.  Mesh Refinement Processes Based on the Generalized Bisection of Simplices , 1984 .

[20]  Andrew Adler,et al.  On the bisection method for triangles , 1983 .