Jsun Yui Wong
“Solving systems of nonlinear equations is perhaps the most difficult problem in all of numerical computations,” Rice [6, 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 [5, 2007, p. 473].
Using qb64v1000-win [7, 9], the following computer program seeks to solve simultaneously Brown’s almost linear system of 1100 equations; see Morgan [4, page 15], Floudas [2, page 660], and the preceding paper. While line 128 of the preceding paper is 128 FOR I = 1 TO 100000 STEP 1, here line 128 is 128 FOR I = 1 TO 500000 STEP 1.
0 DEFDBL A-Z
3 DEFINT J, K
4 DIM X(1103), A(1103), L(1103), K(1103)
5 FOR JJJJ = -32000 TO 32000
14 RANDOMIZE JJJJ
16 M = -1D+17
91 FOR KK = 1 TO 1100
94 A(KK) = RND * 5
95 NEXT KK
128 FOR I = 1 TO 500000 STEP 1
129 FOR K = 1 TO 1100
131 X(K) = A(K)
132 NEXT K
155 FOR IPP = 1 TO FIX(1 + RND * 3)
181 B = 1 + FIX(RND * 1100)
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 X(B) = CINT(A(B))
191 NEXT IPP
301 prodd = 1
305 FOR j55 = 2 TO 1100
311 prodd = prodd * X(j55)
321 NEXT j55
371 IF prodd < .00001 THEN 1670
389 X(1) = (1) / prodd
501 summ = 0
505 FOR j27 = 1 TO 1100
511 summ = summ + X(j27)
521 NEXT j27
901 DIFF = 0
905 FOR J77 = 1 TO 1099
911 DIFF = DIFF – ABS(X(J77) + summ – 1101)
921 NEXT J77
995 P = DIFF
1451 IF P <= M THEN 1670
1657 FOR KEW = 1 TO 1100
1658 A(KEW) = X(KEW)
1659 NEXT KEW
1661 M = P
1670 NEXT I
1890 IF M < -.000001 THEN 1999
1912 PRINT A(1), A(2), A(3)
1933 PRINT A(1097), A(1098), A(1099)
1939 PRINT A(1100), M, JJJJ
1999 NEXT JJJJ
This computer program was run with qb64v1000-win [7, 8]. Copied by hand from the screen, the computer program’s complete output through JJJJ= -31998 is shown below.
.9999999999999865 1 1
1 1 1
1 -2.708944180085382D-14 -32000
.9999999999900124 1 1
1 1 1
1.000000000005344 -1.829503215589057D-11 -31999
1 1 1
1 1 1
1 0 -31998
Above there is no rounding by hand; it is just straight copying by hand from the screen.
Of the 1100 values for the 1100 unknowns, only the 7 A’s of line 1912, line 1933, and line 1939 of the computer program above 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 [7, 8], the wall-clock time for obtaining the output through JJJJ= -31998 was four minutes.
Acknowledgment
I would like to acknowledge the encouragement of Roberta Clark and Tom Clark.
References
[1] R. L. Burden, J. D. Faires. Numerical Analysis, Fifth Edition. PWS Publishing Company, 1993.
[2] C. A. Floudas, Deterministic Global Optimization. Kluwer Academic Publishers, 2000.
[3] 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.
[4] 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
[5] 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.
[6] J. Rice. Numerical Methods, Software, and Analysis, Second Edition. Academic Press, 1993.
[7] E.K. Virtanen (2008-05-26). “Interview With Galleon”.
http://www.basicprogramming.org/PCOPY! issue70/#galleoninterview
[8] Wikipedia, QB64, https://en.wikipedia.org/wiki/QB64
computerprogramsandresults 