Application of interval Newton method to solve nonlinear equations and global optimization
The basic principle of interval arithmetic and the basic algorithm of the interval Newton methods are introduced. The prototype algorithm can not find any zero in an interval that has zero sometimes, that is, it is instable. So the prototype relaxation procedure is improved in this paper. Additionally, an immediate test of the existence of a solution following branch-and-bound is proposed, which avoids unwanted computations in those intervals that have no solution. The numerical results demonstrat that the improved interval Newton method is superior to prototype algorithm in terms of solution quality, stability and convergent speed.
Key wordsinterval algorithm interval Newton method global optimization
Unable to display preview. Download preview PDF.
- 1.Xu C J, Xi C Y (2001) Stability of solution for dynamic geodetic network adjustment.Geo-spatial Information Science, 4(3)Google Scholar
- 5.Nickel K (1971) On the Newton method in interval analysis. Mathematics Research Center Report 1136, University of Wisconsin.Google Scholar
- 8.Li Q Y, Mo Z Z, Qi L Q (1999) Numerical solution of non-linear equations. Beijing: Science Press (in Chinese)Google Scholar
- 9.Ratschek H, Rokne J (1988) New computer methods for global optimization. Chichester: Ellis Horwood Ltd.Google Scholar