LP narrowing: A new strategy for finding all solutions of nonlinear equations

作者:

Highlights:

摘要

An efficient algorithm is proposed for finding all solutions of systems of n nonlinear equations. This algorithm is based on interval analysis and a new strategy called LP narrowing. In the LP narrowing strategy, boxes (n-dimensional rectangles in the solution domain) containing no solution are excluded, and boxes containing solutions are narrowed so that no solution is lost by using linear programming techniques. Since the LP narrowing is very powerful, all solutions can be found very efficiently. By numerical examples, it is shown that the proposed algorithm could find all solutions of systems of 5000–50,000 nonlinear equations in practical computation time.

论文关键词:Nonlinear equation,Interval analysis,Finding all solutions,Linear programming,Dual simplex method

论文评审过程:Available online 13 May 2009.

论文官网地址:https://doi.org/10.1016/j.amc.2009.05.017