Finding all Solutions of Systems of Nonlinear Equations Using the Dual Simplex Method |
| |
Authors: | Kiyotaka Yamamura Shigeru Tanaka |
| |
Institution: | (1) Department of Electrical, Electronic, and Communication Engineering, Chuo University, 1-13-27 Kasuga, Bunkyo-ku, Tokyo, 112-8551, Japan;(2) Mathematical Systems Inc., 2-4-3-10F, Shinjuku, Shinjuku-ku, Tokyo, 160-0022, Japan |
| |
Abstract: | An efficient algorithm is proposed for finding all solutions of nonlinear equations using linear programming (LP). This algorithm is based on a simple test (termed the LP test) for nonexistence of a solution to a system of nonlinear equations in a given region. In the conventional LP test, the system of nonlinear equations is transformed into an LP problem, to which the simplex method is applied. However, although the LP test is very powerful, it requires many pivotings for each region. In this paper, we use the dual simplex method in the LP test, which makes the average number of pivotings per region much smaller (less than one, for example) and makes the algorithm very efficient. By numerical examples, it is shown that the proposed algorithm can find all solutions of systems of 200 nonlinear equations in practical computation time. |
| |
Keywords: | Interval analysis nonlinear equations linear programming dual simplex method |
本文献已被 SpringerLink 等数据库收录! |
|