The monomial method: Extensions, variations, and performance issues. (English) Zbl 0804.65055
The monomial method solves systems of nonlinear algebraic equations by constructing a sequence of approximating monomials. The monomial system becomes linear through a logarithmic transformation of variables. This paper briefly reviews the special properties of the monomial method and compares it to Newton’s method. The algorithm is improved and the method is extended to apply to some non-algebraic systems.
Reviewer: P.Y.Yalamov (Russe)
MSC:
| 65H10 | Numerical computation of solutions to systems of equations |
| 12Y05 | Computational aspects of field theory and polynomials (MSC2010) |
| 26C10 | Real polynomials: location of zeros |
Keywords:
performance; monomial method; systems of nonlinear algebraic equations; logarithmic transformation of variables; Newton’s method; algorithmReferences:
| [1] | Burns, Comput. Aided Design 21 pp 21– (1989) |
| [2] | Burns, Int. j. numer. methods eng. 31 pp 1295– (1991) |
| [3] | and , Geometric Programming, Wiley, New York, 1967, p. 98. |
| [4] | Duffin, SI AM Rev. 12 pp 211– (1970) |
| [5] | and , Inequalities, Springer, Berlin, 1961. · doi:10.1007/978-3-642-64971-4 |
| [6] | and , Inequalities, Cambridge University Press, England, 1959. |
| [7] | Avriel, Int. j. numer methods eng. 9 pp 149– (1975) |
| [8] | Avriel, SIAM J. Appl. Math. 19 pp 125– (1970) |
| [9] | Pascual, J. Opt. Theory Appl. 5 pp 73– (1970) |
| [10] | Passy, SIAM J. Appl. Math. 20 pp 763– (1971) |
| [11] | Burns, Int. j. numer. methods eng. 24 pp 725– (1987) |
| [12] | Rijckaert, Math. Prog. 11 pp 89– (1976) |
| [13] | ’Transformed Newton’s method’, Ph. D. Thesis, Colorado School of Mines, Golden. CO, 1976 |
| [14] | ’Application of the geometric inequality to the solution of systems of nonlinear equations’, Ph. D. Thesis, Colorado School of Mines, Golden, CO, 1980. |
| [15] | ’A proof of convergence for a condensation approach to the solution of nonlinear equations’, M. S. Thesis, Colorado School of Mines, Golden, CO, 1982. |
| [16] | ’A numerical algorithm for the solution of chemical equilibrium problems’, M. S. Thesis, Colorado School of Mines, Golden, CO, 1984. |
| [17] | Wall, Oper. Res. 34 pp 345– (1986) |
| [18] | ’The solution of posynomial equations’, Technical Report #010887-01, Department of Mathematics and Graduate Program in Operations Research, North Carolina State University, Raleigh, NC, 1987. |
| [19] | Duffin, J. Opt. Theory Appl. 11 pp 3– (1973) |
| [20] | and , ’Performance characteristics of two fully-stressed design algorithms for structural, optimization of frame structures’, Proc. 2993 NSF Design and Manufac. Systems Conf., University of North Carolina, Charlotte, NC, 1993. |
| [21] | and , ’Properties of optimal structures’, Proc. Symp. on Applications of Computer Methods in Engineering, University of Southern California. Los Angeles, CA, 1977, pp. 533-542. · Zbl 0386.60010 |
| [22] | and , Numerical Methods, Prentice-Hall, Englewood Cliffs, N. J., 1974, p. 181. |
| [23] | Passy, J. Opt. Theory Appl. 9 pp 221– (1972) |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
