Finding all Solutions of Systems of Nonlinear Equations Using the Dual Simplex Method

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.

[1]  R. Baker Kearfott,et al.  Preconditioners for the interval Gauss-Seidel method , 1990 .

[2]  Ramon E. Moore,et al.  A Successive Interval Test for Nonlinear Systems , 1982 .

[3]  L. Qi.  A Note on the Moore Test for Nonlinear Systems , 1982 .

[4]  R. B. Kearfott,et al.  Applications of interval computations , 1996 .

[5]  Ramon E. Moore.  A Test for Existence of Solutions to Nonlinear Systems , 1977 .

[6]  Leon O. Chua,et al.  Computer-Aided Analysis Of Electronic Circuits , 1975 .

[7]  R. Baker Kearfott,et al.  Some tests of generalized bisection , 1987, TOMS.

[8]  Götz Alefeld,et al.  A QUADRATICALLY CONVERGENT KRAWCZYK-LIKE ALGORITHM* , 1983 .

[9]  A. Neumaier.  Interval iteration for zeros of systems of equations , 1985 .

[10]  M.L. Liou,et al.  Computer-aided analysis of electronic circuits: Algorithms and computational techniques , 1977, Proceedings of the IEEE.

[11]  William H. Press,et al.  The Art of Scientific Computing Second Edition , 1998 .

[12]  K. Yamamura,et al.  Interval solution of nonlinear equations using linear programming , 1998 .

[13]  E. Allgower,et al.  Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations , 1980 .

[14]  M. A. Wolfe,et al.  An improved form of the Krawczyk-Moore algorithm , 1985 .

[15]  G. Alefeld,et al.  Introduction to Interval Computation , 1983 .

[16]  Krawczyk-Like Algorithms for the Solution of Systems of Nonlinear Equations , 1985 .

[17]  M. A. Wolfe,et al.  Some Computable Existence, Uniqueness, and Convergence Tests for Nonlinear Systems , 1985 .

[18]  A. Neumaier.  Interval methods for systems of equations , 1990 .

[19]  Ramon E. Moore,et al.  SAFE STARTING REGIONS FOR ITERATIVE METHODS , 1977 .

[20]  Eldon Hansen,et al.  A globally convergent interval method for computing and bounding real roots , 1978 .

[21]  L. B. Rall.  A Comparison of the Existence Theorems of Kantorovich and Moore , 1980 .

[22]  E. Hansen,et al.  Bounding solutions of systems of equations using interval analysis , 1981 .

[23]  Kiyotaka Yamamura.  Finding All Solutions of Nonlinear Equations Using Linear Combinations of Functions , 2000, Reliab. Comput..

[24]  Kiyotaka Yamamura,et al.  Finding all solutions of piecewise-linear resistive circuits using linear programming , 1996 .

[26]  M. A. Wolfe.  A Modification of Krawczyk’s Algorithm , 1980 .