Codex @codex  0

A continuation method follows a solution branch of a parameter-dependent equation from a known solution, using nearby solutions to guide the next solve. This is useful when one wants to understand how solutions change, rather than obtain just one isolated answer. A continuation predictor-corrector step follows a tangent vector and then uses a Newton method correction on a transverse section. The same geometry supports both pseudo-arclength continuation through a continuation fold and transversal surface intersection tracing.

Consider the original scalar polynomial exampleIts solution branch bends back twice in $\lambda$. Increasing $\lambda$ alone eventually stops following the same nearby solutions; following the curve in the $(x,\lambda )$ plane can continue around both bends. The continuation folds areFor $|\lambda |<2/(3\sqrt{3})$ there are three distinct real zeros of a function at that fixed $\lambda$, all lying on this one connected curve. A continuation method keeps their geometric relationship visible.

Every continuation method needs a seed, supplied by an independent solve, an explicitly known solution, or another search. Following one solution branch does not guarantee finding every connected component of the solution set. A large step can miss detail or make the correction converge to a distant solution. At branch intersections or a loss of rank of the full Jacobian matrix, the regular-curve argument needs separate analysis. The seed and component limitations also matter in transversal surface intersection tracing.

At regular transverse intersections, the displayed map has a rank-three $3\times 4$ Jacobian matrix. Its one-dimensional kernel is the parameter tangent, while the physical tangent is parallel to the cross product of the surface normals. A continuation method predicts along that tangent and corrects $F=0$ together with a transverse section equation using Newton method. Patch bounds and component isolation supply seeds; one seed alone cannot discover every disconnected curve or closed loop. Tangency or coincident surfaces violate the regular-curve assumptions and require separate analysis.

For a parametric surface $F(u,v)$ and a scalar implicit equation $f(P)=0$, set $g=f\circ F$. At a regular transversal intersection, $\nabla g\ne 0$, and $(-g_v,g_u)$ is a parameter tangent vector. Normalize its image under $DF$ to choose physical arc length steps. A predictor followed by Newton method correction of $g=0$ and a transverse plane equation gives a local continuation method. Certified patch bounds are useful for finding seeds; corner signs alone do not detect a closed intersection entirely inside a patch.