Jsun Yui Wong
“Solving systems of nonlinear equations is perhaps the most difficult problem in all of numerical computations,” Rice [8, 1993, p. 355].
“We make an extreme, but wholly defensible, statement: There are no good, general methods for solving systems of more than one nonlinear equation. Furthermore, it is not hard to see why (very likely) there never will be any good, general methods,” Press, Teukolsky, Vetterling, and Flannery [7, 2007, p. 473].
“Solving a system of nonlinear equations is a problem that is avoided where possible, customarily by approximating the nonlinear system by a system of linear equations. When this is unsatisfactory, the problem must be tackled directly,” Burden, Faires, and Burden [1, 2016, page 642].
Using qb64v1000-win [9], the following computer program seeks to solve the logarithmic problem in Cao [2, p. 7, Problem 11]; here the case of 55 simultaneous equations/unknowns is considered. One notes line 187, which is
187 IF RND < .25 THEN X(B) = A(B) + RND * R ELSE IF RND < .333 THEN X(B) = A(B) + RND ^ 4 * R ELSE IF RND < .5 THEN X(B) = A(B) + RND ^ 7 * R ELSE IF RND < .5 THEN X(B) = FIX(A(B)) ELSE X(B) = FIX(A(B)) + 1.
0 DEFDBL A-Z
3 DEFINT J, K
4 DIM X(52768), A(52768), K(52768), P(52222)
5 FOR JJJJ = -32000 TO 32000
14 RANDOMIZE JJJJ
16 M = -1D+50
91 FOR KK = 1 TO 55
94 A(KK) = RND * (1)
95 NEXT KK
128 FOR I = 1 TO 3000000 STEP 1
129 FOR K = 1 TO 55
131 X(K) = A(K)
132 NEXT K
155 FOR IPP = 1 TO FIX(1 + RND * 3)
181 B = 1 + FIX(RND * 55)
183 R = (1 – RND * 2) * A(B)
187 IF RND < .25 THEN X(B) = A(B) + RND * R ELSE IF RND < .333 THEN X(B) = A(B) + RND ^ 4 * R ELSE IF RND < .5 THEN X(B) = A(B) + RND ^ 7 * R ELSE IF RND < .5 THEN X(B) = FIX(A(B)) ELSE X(B) = FIX(A(B)) + 1
191 NEXT IPP
771 FOR J44 = 1 TO 55
773 P(J44) = -ABS(LOG(X(J44) + 1) – X(J44) / 55)
777 NEXT J44
800 P = 0
801 FOR J44 = 1 TO 55
822 P = P + P(J44)
888 NEXT J44
999 REM
1111 P = P
1451 IF P <= M THEN 1670
1657 FOR KEW = 1 TO 55
1658 A(KEW) = X(KEW)
1659 NEXT KEW
1661 M = P
1670 NEXT I
1890 REM IF M < -500 THEN 1999
1912 PRINT A(1), A(2), A(3)
1914 PRINT A(4), A(5), A(5)
1917 PRINT A(49), A(50), A(51)
1927 PRINT A(52), A(53), A(54)
1949 PRINT A(55), M, JJJJ
1999 NEXT JJJJ
This computer program was run with qb64v1000-win [9]. Copied by hand from the screen, the computer program’s complete output through
JJJJ= -31999 is shown below.
0 0 0
0 0 0
0 0 0
0 0 0
0 0 -32000
0 0 0
0 0 0
0 0 0
0 0 0
0 0 -31999
Above there is no rounding by hand; it is just straight copying by hand from the screen.
Of the 55 unknowns, only the 13 A’s of line 1912 through line 1949 are shown above.
On a personal computer with a Pentium Dual-Core CPU E5200 @2.50GHz, 2.50 GHz, 960 MB of RAM and with qb64v1000-win [9], the wall-clock time for obtaining the output through JJJJ= -31999 was 80 seconds.
Acknowledgment
I would like to acknowledge the encouragement of Roberta Clark and Tom Clark.
References
[1] R. L. Burden, J. D. Faires, Annette M. Burden. Numerical Analysis, Tenth Edition. Cengage Learning, 2016.
[2] Huiping Cao, Global Convergence of Schubert’s Method for Solving Sparse Nonlinear Equations, Abstract and Applied Analysis, Volume 2014, Article ID 251587, 12 pages. Hindawi Publishing Corporation. http://dx.doi.org/10.1155/2014/251587
[3] C. A. Floudas, Deterministic Global Optimization. Kluwer Academic Publishers, 2000.
[4] Tianmin Han, Yuhuan Han, Solving Large Scale Nonlinear Equations by a New ODE Numerical Integration Method, Applied Mathematics, 2010, 1, 222-229.
http://www.SciRP.org/journal/am
[5] Microsoft Corp. BASIC, second edition (May 1982), Version 1.10. Boca Raton, Florida: IBM Corp., Personal Computer, P. O. Box 1328-C, Boca Raton, Florida 33432, 1981.
[6] Alexander P. Morgan, A Method for Computing All Solutions to Systems of Polynomial Equations, ACM Transactions on Mathematical Software, Vol. 9, No. 1, March 1983, Pages 1-17. https://folk.uib.no/ssu029/pdf_file/Morgan83.pdf
[7] W. H. Press, S. A. Teukolsky, W. T. Vetterling, B. P. Flannery. Numerical recipes: the art of scientific computing, third ed. Cambridge University Press, 2007.
[8] J. Rice. Numerical Methods, Software, and Analysis, Second Edition. Academic Press, 1993.
[9] Wikipedia, QB64, https://en.wikipedia.org/wiki/QB64
[10] M. Ziani, F. Guyomarc’h, An Autoadaptive Limited Memory Broyden’s Method To Solve Systems of Nonlinear Equations, Applied Mathematics and Computation 205 (2008) pp. 202-211. web.info.uvt.ro/~cristiana.drogoescu/MC/broyden.pdf
computerprogramsandresults 