Hybrid second order method for orthogonal projection onto parametric curve in \(n\)-dimensional Euclidean space (Q2337268)

Summary: Orthogonal projection a point onto a parametric curve, three classic first order algorithms have been presented by \textit{E. Hartmann} [Comput. Aided Geom. Des. 16, No. 5, 355--376 (1999; Zbl 0916.68159)], \textit{J. Hoschek} and \textit{D. Lasser} [Fundamentals of computer aided geometric design. Translated from the German by Larry L. Schumaker. Wellesley, MA: A. K. Peters (1993; Zbl 0788.68002)] and \textit{S. M. Hu} et al. [``Computing the parameter of points on NURBS curves and surfaces via moving affine frame method'', J. Softw. 2000, No. 11, 49--53 (2000)] (hereafter, H-H-H method). In this research, we give a proof of the approach's first order convergence and its non-dependence on the initial value. For some special cases of divergence for the H-H-H method, we combine it with Newton's second order method (hereafter, Newton's method) to create the hybrid second order method for orthogonal projection onto parametric curve in an \(n\)-dimensional Euclidean space (hereafter, our method). Our method essentially utilizes hybrid iteration, so it converges faster than current methods with a second order convergence and remains independent from the initial value. We provide some numerical examples to confirm robustness and high efficiency of the method.