Hybrid second-order iterative algorithm for orthogonal projection onto a parametric surface

10Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

To compute the minimum distance between a point and a parametric surface, three well-known first-order algorithms have been proposed by Hartmann (1999), Hoschek, et al. (1993) and Hu, et al. (2000) (hereafter, the First-Order method). In this paper, we prove the method's first-order convergence and its independence of the initial value. We also give some numerical examples to illustrate its faster convergence than the existing methods. For some special cases where the First-Order method does not converge, we combine it with Newton's second-order iterative method to present the hybrid second-order algorithm. Our method essentially exploits hybrid iteration, thus it performs very well with a second-order convergence, it is faster than the existing methods and it is independent of the initial value. Some numerical examples confirm our conclusion.

Cite

CITATION STYLE

APA

Li, X., Wang, L., Wu, Z., Hou, L., Liang, J., & Li, Q. (2017). Hybrid second-order iterative algorithm for orthogonal projection onto a parametric surface. Symmetry, 9(8). https://doi.org/10.3390/sym9080146

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free