基于区间牛顿法的点到参数曲线最小距离的计算方法钱春.pdfVIP

第 27卷第 1期 Vol. 27 No. 1 2010年 1月 Journal ofM echanical ElectricalEng ineering Jan. 2010 基于区间牛顿法的点到参数曲线最小距离的计算方法 钱 春 ( , 310018) : 求解点到参数曲线的最小距离常常用 一般的有哪些信誉好的足球投注网站算法针对有哪些信誉好的足球投注网站算法的稳 性和有效性通常 不高的问题,基于参数曲线的几何特性,将求最小距离转化为方程求解问题,应用了区间牛顿法来求解 方程研究结果表明, 区间牛顿法是一个全局收敛的方程求根算法, 具有较高的稳 性 : 参数曲线; 最小距离; 区间算术; 区间牛顿法 : TP391. 72 : A : 1001- 4551( 2010) 01- 0082- 03 Com pu ting m ethod for the m inim um distance from a point to a param etric curve based on th e in tervalN ew ton m ethod QIAN Chun (School of Statistics App liedM athemetics, Zhejiang Gongshang University, Hangzhou 310018, hina) Abstrac t: Searching algorith is popularly used for solving the proble how to co pute the ini u distance fro apoint to a para etric curve. A i ing at the poor stability and the low efficiency of the searching algorith , based on the geo etric character- istics of the para etric curve, theproble of finding the ini u valuewas changed into theproble of finding roots of an equa- tion. IntervalNewton ethod was adopted to solve the equation. The results indicate that IntervalNewton ethod is aglobalcon- vergence algorith , and it is very stable. K ey word s: para etric curve; ini u distance; intervalarith etic; intervalNewton ethod P (t ): 0 引 言 0 T = (xc(t ), yc(t ), zc(t ) ) P 0 0 0 CADCG Q(x , y , z ),