A geometric Newton-Raphson strategy

From MaRDI portal





In the standard Newton-Raphson algorithm for solving nonlinear equations, a new guess is computed by solving a linear approximation of the problem at the current guess. A similar, very effective strategy is proposed here for solving geometric problems (e.g., finding intersections) on general plane curves. To compute a new guess, solve an elementary geometric approximation of the problem at the current guess.











This page was built for publication: A geometric Newton-Raphson strategy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5958643)