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.
Recommendations
Cites work
- A generalized Newton–Raphson method using curvature
- A new method using the circles of curvature for solving equations in \(R^ 1\)
- Elementary differential geometry
- scientific article; zbMATH DE number 3488494 (Why is no real title available?)
- scientific article; zbMATH DE number 3325202 (Why is no real title available?)
Cited in
(7)- Geometric Newton-Raphson methods for plane curves
- Properties of nonlinear systems and convergence of the Newton-Raphson method in geometric constraint solving
- scientific article; zbMATH DE number 1008337 (Why is no real title available?)
- scientific article; zbMATH DE number 5049616 (Why is no real title available?)
- Geometric reinterpretation of the Newton-Raphson method and deduction of a new algorithm
- Graphical representations for the homogeneous bivariate Newton's method
- Computing laser beam paths in optical cavities: an approach based on geometric Newton method
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)