Publisher Summary
This chapter discusses two new families of triangulations and corresponding fixed point algorithms, both allowing for an arbitrary grid refinement using a homotopy type fixed point algorithm. While the first is a directly constructed triangulation featuring an arbitrary grid refinement, the second relies on the fact that instead of looking for new triangulations, one can manipulate the function by dilating it around the approximate fixed point, thus achieving the same effect as a grid refinement. However, one can also consider the dual point of view, that of deforming the triangulation while keeping the function fixed. The latter approach gives more insight into the mechanism and convergence properties of the new algorithms, and is discussed in the chapter. The dynamic shift algorithm is based on a totally new approach to the problem of refining the grid by an arbitrary factor for homotopy type fixed-point algorithms. In constructing a homotopy—and, to a certain extent, also a restart— algorithm, one is restricted by the triangulations that one can use.