试位法的一种改进及其收敛性分析
An Improvement of the Regular Falsi Method and Its Convergence Analysis
摘要:
试位法是用数值方法求单变量非线性方程根的算法,方法简单易行。试位法作为二分法的改进,在大多数情况下优于二分法。本文结合二分法与试位法,给出了试位法的一种改进算法,并对其收敛情况进行了讨论,证明该算法的收敛性,给出了收敛指数的估计。
Abstract:
The Regular Falsi method is an algorithm for finding the root of a univariate nonlinear equation by numerical method. The method is simple and easy. The Regular Falsi method is an improvement of the Bisection method and is superior to the Bisection method in most cases. In this paper, an improved algorithm of the test method is given by combining the dichotomy and the test position method. The convergence of the algorithm is proved and the convergence index is estimated.
参考文献
|
[1]
|
Dowell, M. and Jarratt, P. (1971) A Modified Regular Falsi Method for Computing the Root of an Equation. BIT Nu-merical Mathematics, 11, 168-174. [Google Scholar] [CrossRef]
|
|
[2]
|
Anderson, N. and Björck, Å. (1973) A New High Order Method of Regula Falsi Type for Computing a Root of an Equation. BIT Numerical Mathematics, 13, 253-264. [Google Scholar] [CrossRef]
|
|
[3]
|
Young, D. and Gregory, R. (1972) A Survey of Numerical Mathmatics. Addison-Wesley, Reading.
|
|
[4]
|
Ford, J. (1995) Improved Algorithms of Illinois-Type for the Numerical Solution of Nonlinear Equations. ACM Transactions on Mathematical Software, 30, 64-85.
|
|
[5]
|
Szidarovszky, F. and Yakowitz, S. (1980) Principles and Procedures of Numerical Analysis, American Scientist. Plenum Press, New York.
|