Hostname: page-component-8448b6f56d-dnltx Total loading time: 0 Render date: 2024-04-23T15:07:10.527Z Has data issue: false hasContentIssue false

Solving polynomial systems using a fast adaptive back propagation-type neural network algorithm

Published online by Cambridge University Press:  20 June 2017

K. GOULIANAS
Affiliation:
ATEI of Thessaloniki, Department of Information Technology, GR 574 00, Thessaloniki, Greece emails: gouliana@it.teithe.gr, kdiamant@it.teithe.gr
A. MARGARIS
Affiliation:
TEI of Thessaly, Department of Computer Science and Engineering, GR 411 10, Larissa, Greece email: amarg@uom.gr
I. REFANIDIS
Affiliation:
Department of Applied Informatics, University of Macedonia, GR 540 06, Thessaloniki, Greece email: yrefanid@uom.gr
K. DIAMANTARAS
Affiliation:
ATEI of Thessaloniki, Department of Information Technology, GR 574 00, Thessaloniki, Greece emails: gouliana@it.teithe.gr, kdiamant@it.teithe.gr

Abstract

This paper proposes a neural network architecture for solving systems of non-linear equations. A back propagation algorithm is applied to solve the problem, using an adaptive learning rate procedure, based on the minimization of the mean squared error function defined by the system, as well as the network activation function, which can be linear or non-linear. The results obtained are compared with some of the standard global optimization techniques that are used for solving non-linear equations systems. The method was tested with some well-known and difficult applications (such as Gauss–Legendre 2-point formula for numerical integration, chemical equilibrium application, kinematic application, neuropsychology application, combustion application and interval arithmetic benchmark) in order to evaluate the performance of the new approach. Empirical results reveal that the proposed method is characterized by fast convergence and is able to deal with high-dimensional equations systems.

Type
Papers
Copyright
Copyright © Cambridge University Press 2017 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] Barron, A. R. (1933) Universal approximation bounds for superpositions of a sigmoidal function. IEEE Trans. Inform. Theory 39 (3), 930945.Google Scholar
[2] Broyden, C. G. (1965) A class of methods for solving nonlinear simultaneous equations. Math. Comput. 19 (92), 577593.CrossRefGoogle Scholar
[3] Broyden, C. G., Dennis, J. E. & More, J. J. (1993) On the local and the superlineal convergences of quasi-Newton methods. J. Inst. Math. Appl. 12 (3), 223246.Google Scholar
[4] Burden, R. L., Faires, J. D. & Burden, A. M. (2015) Numerical Analysis, ISBN 978-1305253667, Brooks Cole, Boston, USA.Google Scholar
[5] Cao, F. & Chen, Z. (2009) The approximation operators with sigmoidal functions. Comput. Math. Appl. 58 (4), 758765.Google Scholar
[6] Cao, F. & Chen, Z. (2012) The construction and approximation of a class of neural networks operators with ramp functions. J. Comput. Anal. Appl. 14 (1), 101112.Google Scholar
[7] Costarelli, D. (2015) Neural network operators: Constructive interpolation of multivariate functions. Neural Netw. 67, 2836.Google Scholar
[8] Costarelli, D. & Vinti, G. (2016) Max-product neural network and quasi interpolation operators activated by sigmoidal functions. J. Approx. Theory 209, 122.CrossRefGoogle Scholar
[9] Costarelli, D. & Vinti, G. (2016) Pointwise and uniform approximation by multivariate neural network operators of the max-product type. Neural Netw. 81, 8190.Google Scholar
[10] Costarelli, D. & Vinti, G. (2016) Approximation by max-product neural network operators of Kantorovich type. Results Math. 69 (3), 505519.CrossRefGoogle Scholar
[11] Dennis, J. E. & Wolkowicz, H. (1993) Least change secant method, sizing and shifting. SIAM J. Numer. Anal. 30 (5), 12911314.Google Scholar
[12] El-Emary, I. M. M. & El-Kareem, M. M. A. (2008) Towards using genetic algorithms for solving nonlinear equation systems. World Appl. Sci. J. 5 (3), 282289.Google Scholar
[13] Goulianas, K., Margaris, A. & Adamopoulos, M. (2013) Finding all real roots of 3 × 3 nonlinear algebraic systems using neural networks. Appl. Math. Comput. 219 (9), 44444464.Google Scholar
[14] Grosan, C., Abraham, A. & Snasel, V. (2012) Solving polynomial systems using a modified line search approach. Int. J. Innovative Comput. Inform. Control 8 (1) (B), 501526.Google Scholar
[15] Grosan, C. & Abraham, A. (2012) Multiple solutions of a system of nonlinear equations. Int. J. Innovative Comput. Inform. Control 4 (9), 21612170.Google Scholar
[16] Hahm, N. & Hong, B. I. (2016) A Note on neural network approximation with a sigmoidal function. Appl. Math. Sci. 10 (42), 20752085.Google Scholar
[17] Iliev, A., Kyurkchiev, N. & Markov, S. (2015) On the approximation of the cut and step functions by logistic and Gompertz functions. BIOMATH 4 (2), 112.Google Scholar
[18] Karr, C. L, Weck, B. & Freeman, L. M. (1998) Solution to systems of nonlinear equations via a generic algorithm. Eng. Appl. Artif. Intell. 11, 369375.Google Scholar
[19] Ko, T. H., Sakkalis, T. & Patrikalakis, N. M. (2004) Nonlinear polynomial systems: Multiple roots and their multiplicities. In: Giannini, F. & Pasko, A. (editors), Proceedings of Shape Modelling International Conference, SMI 2004, Genova, Italy.Google Scholar
[20] Mamat, M., Muhammad, K. & Waziri, M. Y. (2014) Trapezoidal Broyden's method for solving systems of nonlinear equations. Appl. Math. Sci. 8 (6), 251260.Google Scholar
[21] Manocha, D. (1994) Solving Systems of polynomial equations. IEEE Comput. Graph. Appl. 14 (2), 4655.CrossRefGoogle Scholar
[22] Margaris, A. & Goulianas, K. (2012) Finding all roots of 2 × 2 non linear algebraic systems using back propagation neural networks. In: Neural Computing and Applications, Vol. 21(5), Springer-Verlag London Limited, pp. 891904.Google Scholar
[23] Martinez, J. M. (1994) Algorithms for solving nonlinear systems of equations. In: Continuous Optimization: The State of the Art, Kluwer, pp. 81108.Google Scholar
[24] Martynyuk, A. A. (2008) An exploration of polydynamics of nonlinear equations on time scales. ICIC Exp. Lett. 2 (2), 155160.Google Scholar
[25] Mathia, K. & Saeks, R. (1995) Solving nonlinear equations using reccurent neural networks. In: World Congress on Neural Networks (WCNN'95), Washington DC, pages I-76 to I-80.Google Scholar
[26] Mhetre, P. (2012) Genetic algorithm for linear and nonlinear equation. Int. J. Adv. Eng. Technol. 3 (2), 114118.Google Scholar
[27] Mishra, D. & Kalra, P. (2007) Modified hopfield neural network approach for solving nonlinear algebraic equations. Eng. Lett. 14 (1), 135142.Google Scholar
[28] Nguyen, T. T. (1993) Neural network architecture of solving nonlinear equation systems. Electron. Lett. 29 (16), 14031405.Google Scholar
[29] Oliveira, H. A. & Petraglia, A. (2013) Solving nonlinear systems of functional equations with fuzzy adaptive simulated annealing. Appl. Soft Comput. 13 (11), 43494357.Google Scholar
[30] Ortega, J. M. & Rheinboldt, W. C. (1970) Iterative Solution of Nonlinear Equations in Several Variables, Academic Press, New York.Google Scholar
[31] Rheinboldt, W. C. (1974) Methods for solving systems of equations. Reg. Conf. Ser. Appl. Math 14.Google Scholar
[32] Schmidhuber, J. (2015) Deep learning in neural networks: An overview. Neural Netw. 61, 85117.Google Scholar
[33] Spedicato, E. & Huang, Z. (1997) Numerical experience with Newton-like methods for nonlinear algebraic systems. Computing 58 (1), 6989.Google Scholar
[34] Zhou, G. & Zhu, P. (2010) Iterative algorithms for solving repeated root of nonlinear equation by modified Adomian decomposition method. ICIC Exp. Lett. 4 (2), 595600.Google Scholar
[35] Zhoug, X., Zhang, T. & Shi, Y. (2009) Oscillation and nonoscillation of neutral difference equation, with positive and negative coefficients. Int. J. Innovative Comput. Inform. Control 5 (5), 13291342.Google Scholar