Simplicial continuation, or piecewise linear continuation (Allgower and Georg), is a one-parameter continuation method which is well suited to small to medium embedding spaces. The algorithm has been generalized to compute higher-dimensional manifolds by (Allgower and Gnutzman) and (Allgower and Schmidt). The algorithm for drawing contours is a simplicial continuation algorithm, and since it is easy to visualize, it serves as a good introduction to the algorithm.
Contour plotting The contour plotting problem is to find the zeros (contours) of f ( x , y ) = 0 {\displaystyle f(x,y)=0\,} ( f ( ⋅ ) {\displaystyle f(\cdot )\,} a smooth scalar valued function) in the square 0 ≤ x ≤ 1 , 0 ≤ y ≤ 1 {\displaystyle 0\leq x\leq 1,0\leq y\leq 1\,} ,
The square is divided into small triangles, usually by introducing points at the corners of a regular square mesh i h x ≤ x ≤ ( i + 1 ) h x {\displaystyle ih_{x}\leq x\leq (i+1)h_{x}\,} , j h y ≤ y ≤ ( j + 1 ) h y {\displaystyle jh_{y}\leq y\leq (j+1)h_{y}\,} , making a table of the values of f ( x i , y j ) {\displaystyle f(x_{i},y_{j})\,} at each corner ( i , j ) {\displaystyle (i,j)\,} , and then dividing each square into two triangles. The value of f ( x i , y j ) {\displaystyle f(x_{i},y_{j})\,} at the corners of the triangle defines a unique Piecewise Linear interpolant l f ( x , y ) {\displaystyle lf(x,y)\,} to f ( ⋅ ) {\displaystyle f(\cdot )\,} over each triangle. One way of writing this interpolant on the triangle with corners
( x 0 , y 0 ) , ( x 1 , y 1 ) , ( x 2 , y 2 ) {\displaystyle (x_{0},y_{0}),~(x_{1},y_{1}),~(x_{2},y_{2})\,} is as the set of equations
( x , y ) = ( x 0 , y 0 ) + ( x 1 − x 0 , y 1 − y 0 ) s + ( x 2 − x 0 , y 2 − y 0 ) t {\displaystyle (x,y)=(x_{0},y_{0})+(x_{1}-x_{0},y_{1}-y_{0})s+(x_{2}-x_{0},y_{2}-y_{0})t\,}
0 ≤ s {\displaystyle 0\leq s\,}
0 ≤ t {\displaystyle 0\leq t\,}
s + t ≤ 1 {\displaystyle s+t\leq 1\,}
l f ( x , y ) = f ( x 0 , y 0 ) + ( f ( x 1 , y 1 ) − f ( x 0 , y 0 ) ) s + ( f ( x 2 , y 2 ) − f ( x 0 , y 0 ) ) t {\displaystyle lf(x,y)=f(x_{0},y_{0})+(f(x_{1},y_{1})-f(x_{0},y_{0}))s+(f(x_{2},y_{2})-f(x_{0},y_{0}))t\,}
… excerpt ends here. Continue reading the full article.






