The \(D_ 2\)-triangulation for simplicial homotopy algorithms for computing solutions of nonlinear equations (Q687034)

A triangulation of arbitrary refinement of grid sizes of \((0,1) \times \mathbb{R}^ n\) is proposed for simplicial homotopy methods for solving nonlinear equations. On each level the new triangulation, called the \(D_ 2\)-triangulation, subdivides \(\mathbb{R}^ n\) into simplices according to the \(D_ 1\)-triangulation. A comparison of triangulations for simplicial homotopy methods is included. Numerical tests show that the proposed simplicial homotopy method is much more efficient.