论文信息 - A variable rate refining triangulation

A variable rate refining triangulation

A new variable rate refining subdivisionB4 for the solution of equations with piecewise linear homotopies and restart homotopies is described. The essential virtue of the subdivisionB4 is that it offers vast latitude to the user. In particular, the parameters ofB4 can be set so one restriction ofB4 is thatJ3 triangulation and another restriction is the octahedral subdivision. More generally, full flexibility is available in the placement of local focal points, and perhaps most importantly,B4 permits the new capability of refining coordinates at variable andindependent rates.

Mark Broadie | B. Curtis Eaves | M. Broadie | B. Curtis Eaves

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

[2] M. Todd. Improving the convergence of fixed-point algorithms , 1978 .

[3] Gerard van der Laan,et al. A new subdivision for computing fixed points with a homotopy algorithm , 1980, Math. Program..

[4] B. Curtis Eaves,et al. Homotopies for computation of fixed points on unbounded regions , 1972, Math. Program..

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

[6] Alden H. Wright,et al. The octahedral algorithm, a new simplicial fixed point algorithm , 1981, Math. Program..

[7] Michael J. Todd,et al. On triangulations for computing fixed points , 1976, Math. Program..

[8] Masakazu Kojima,et al. Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods , 1982, Math. Program..

[9] Shlomo Shamir. Two New Triangulations for Homotopy Fixed Point Algorithms with an Arbitrary Grid Refinement , 1980 .