Secant algorithm in multi - point contact machining 多點切觸加工的割線法
An asynchronous parallel algorithm about the secant method for solving nonlinear systems of equations 一個用割線法求解非線性方程組的異步并行算法
The advantage of this algorithm is that its computing quantity and computing time are less than the divide - and - conquer algorithm of k . y . li . with good parallelism in nature , it is quite suitable for parallel processing 該算法利用割線法迭代計算廣義特征值,具有計算量少,計算速度快的優(yōu)點,并且算法具有內(nèi)在并行性。
The new algorithm bases on bisection and secant iteration , which is different cuppen ' s method and newton iteration . the results of theoretical analysis and numerical testing show that convergent rant of our algorithm is obviously faster that of the classical algorithm 該算法以割線法迭代為基礎(chǔ),明顯不同與傳統(tǒng)的newton迭代法,理論和數(shù)值實驗表明改進的算法的收斂性比經(jīng)典算法好
This paper explorates the method of nonlinear approximate equation root of " secant line rule " in theory , and disusses two vertexes of secant line rule and one vertex of secant line rule with two kinds of different thought methods and in order to clear some suspicions of learners , which is used as a reference 現(xiàn)對“割線法”求解非線性方程近似根的方法,從理論上進行了探討,并用兩種不同的思維方式雙點割線法和單點割線法進行討論,來澄清學習者的一些疑惑,以供參考。