Skip to main content

MRF–PSO: MultiRoot Finding Particle Swarm Optimization Algorithm for Nonlinear Functions

  • 263 Accesses

Part of the Algorithms for Intelligent Systems book series (AIS)

Abstract

Finding approximations to the zeros or roots of nonlinear functions is a task that is often required in various applications in different fields of science and engineering. Although there are many iterative methods that can be used for finding such roots, they typically need good initial approximations to converge, and a number of them also demand the computation of derivatives, which is not always possible and in addition can be computationally intensive, or even request repeated deflations or many algorithm runs with different initial guesses for finding all roots. Finding roots of systems of nonlinear functions is an even more complex problem. This paper presents a novel variant of the particle swarm optimization algorithm for root finding aiming to surpass these drawbacks. The MultiRoot Finding Particle Swarm Optimization (MRF–PSO) algorithm here proposed uses multiple swarms for exploring the space of solutions and simultaneously find approximations for the different single or multiple roots of a given nonlinear function. An architecture for information sharing, a technique for detecting equal roots within a given tolerance, and an intelligent particle positioning strategy are also suggested. The proposed algorithm was tested with a set of nonlinear functions, and the results obtained were compared with others available in the literature. Results revealed that the MRF–PSO algorithm constitutes an effective approach for root finding and can be certainly exploited in real-world problems from science and engineering.

Keywords

  • Computational intelligence
  • Particle swarm optimization
  • Root finding
  • Nonlinear functions
  • Nonlinear systems

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Abraham S, Sanyal S, Sanglikar M (2010) Particle swarm optimisation based Diophantine equation solver. Int J Bio-Inspired Comput 2(2):100–114

    CrossRef  Google Scholar 

  2. Amaya I, Cruz J, Correa R (2011) Real roots of nonlinear systems of equations through a metaheuristic algorithm. DYNA-Revista de la Facultad de Minas 78(170):15–23

    Google Scholar 

  3. van den Bergh F (2002) An analysis of particle swarm optimizers. Ph.D. thesis, University of Pretoria, Pretoria, South Africa

    Google Scholar 

  4. Bezanson J, Karpinski S, Shah VB, Edelman A (2012) Julia: a fast dynamic language for technical computing. arXiv:1209.5145

  5. Brits R (2002) Niching strategies for particle swarm optimization. Master’s thesis, Faculty of Natural & Agricultural Science, University of Pretoria, Pretoria, South Africa

    Google Scholar 

  6. Brits R, Engelbrecht AP, van den Bergh F (2002) Solving systems of unconstrained equations using particle swarm optimization. In: IEEE international conference on systems, man and cybernetics, SMC, vol 3. Yasmine Hammamet, Tunisia, pp 6:1–6:6

    Google Scholar 

  7. Bui LT, Soliman O, Abbass HA (2007) A modified strategy for the constriction factor in particle swarm optimization. In: 3rd Australasian Conference on Artificial Life and Computational Intelligence. ACAL. Geelong, Australia, pp 333–344

    Google Scholar 

  8. Clerc M (1999) The swarm and the queen: towards a deterministic and adaptive particle swarm optimization. In: IEEE Congress on Evolutionary Computation, CEC, vol 3. Washington, WA, USA, pp 1951–1957

    Google Scholar 

  9. Eberhart R, Kennedy J (1995) A new optimizer using particle swarm theory. In: 6th international symposium on Micro Machine and Human Science, MHS. Nagoya, Japan, pp 39–43

    Google Scholar 

  10. Eberhart RC, Shi Y (2000) Comparing inertia weights and constriction factors in particle swarm optimization. In: IEEE Congress on Evolutionary Computation, CEC, vol 1. La Jolla, CA, USA, pp 84–88

    Google Scholar 

  11. El-Gallad A, El-Hawary M, Sallam A, Kalas A (2002) Enhancing the particle swarm optimizer via proper parameters selection. IEEE Canadian Conference on Electrical and Computer Engineering, vol 2. CCECE, Winnipeg, Canada, pp 792–797

    Google Scholar 

  12. Freitas D, Lopes LG, Morgado-Dias F (2018) A neural network based approach for approximating real roots of polynomials. In: International Conference on Mathematical Applications. ICMA. Funchal, Portugal, pp 44–47

    Google Scholar 

  13. Hirsch MJ, Pardalos PM, Resende MG (2009) Solving systems of nonlinear equations with continuous GRASP. Nonlinear Anal: Real World Appl 10(4):2000–2006

    CrossRef  MathSciNet  MATH  Google Scholar 

  14. Huang DS (2004) A constructive approach for finding arbitrary roots of polynomials by neural networks. IEEE Trans Neural Netw 15(2):477–491

    CrossRef  Google Scholar 

  15. Ibrahim AM, Tawhid MA (2019) A hybridization of cuckoo search and particle swarm optimization for solving nonlinear systems. Evol Intelli 12(4):541–561

    CrossRef  Google Scholar 

  16. Jaberipour M, Khorram E, Karimi B (2011) Particle swarm algorithm for solving systems of nonlinear equations. Comput Math Appl 62(2):566–576

    CrossRef  MathSciNet  MATH  Google Scholar 

  17. Jamil M, Yang XS (2013) A literature survey of benchmark functions for global optimisation problems. Int J Math Modelling Numer Optimisation 4(2):150–194

    CrossRef  MATH  Google Scholar 

  18. Jia R, He D (2012) Hybrid artificial bee colony algorithm for solving nonlinear system of equations. In: 8th international conference on Computational Intelligence and Security, CIS. Guangzhou, China, pp 56–60

    Google Scholar 

  19. Kar R, Mandal D, Bardhan S, Ghoshal SP (2011) Optimization of linear phase FIR band pass filter using particle swarm optimization with constriction factor and inertia weight approach. In: IEEE symposium on Industrial Electronics and Applications, ICIEA, Langkawi, Malaysia, pp 326–331

    Google Scholar 

  20. Karr CL, Weck B, Freeman LM (1998) Solutions to systems of nonlinear equations via genetic algorithms. Eng Appl Artif Intelli 11(3):269–375

    Google Scholar 

  21. Kennedy J (2000) Stereotyping: improving particle swarm performance with cluster analysis. In: IEEE Congress on Evolutionary Computation, CEC, vol 2. La Jolla, CA, USA, pp 1507–1512

    Google Scholar 

  22. Kennedy J, Eberhart R (1995) Particle swarm optimization. In: International Conference on Neural Networks, vol 4. ICNN, Perth, Australia, pp 1942–1948

    Google Scholar 

  23. Liu Q, Wei W, Yuan H, Zhan ZH, Li Y (2016) Topology selection for particle swarm optimization. Information Sci 363:154–173

    CrossRef  Google Scholar 

  24. Mai XF, Li L (2013) Bacterial foraging algorithm based on PSO with adaptive inertia weigh for solving nonlinear equations systems. Adv Mater Res 655:940–947

    CrossRef  Google Scholar 

  25. Mendes R, Kennedy J, Neves J (2004) The fully informed particle swarm: simpler, maybe better. IEEE Trans Evol Comput 8(3):204–210

    CrossRef  Google Scholar 

  26. Mo Y, Liu H, Wang Q (2009) Conjugate direction particle swarm optimization solving systems of nonlinear equations. Comput Math Appl 57(11):1877–1882

    CrossRef  MathSciNet  MATH  Google Scholar 

  27. Moritz P, Nishihara R, Wang S, Tumanov A, Liaw R, Liang E, Elibol M, Yang Z, Paul W, Jordan MI, Ray IS (2018) Ray: a distributed framework for emerging AI applications. In: 13rd USENIX symposium on Operating Systems Design and Implementation, OSDI, Carlsbad, CA, USA, pp 561–577

    Google Scholar 

  28. Ouyang A, Zhou Y, Luo Q (2009) Hybrid particle swarm optimization algorithm for solving systems of nonlinear equations. In: IEEE international conference on Granular Computing, GrC, Nanchang, China, pp 460–465

    Google Scholar 

  29. Parsopoulos KE, Vrahatis MN (2002) Particle swarm optimization method for constrained optimization problem. In: Frontiers in artificial intelligence and applications, vol 76. IOS Press, Fairfax, VA, USA, pp 214–220

    Google Scholar 

  30. Pérez O, Amaya I, Correa R (2013) Numerical solution of certain exponential and non-linear Diophantine systems of equations by using a discrete particle swarm optimization algorithm. Appl Math Comput 225:737–746

    MathSciNet  MATH  Google Scholar 

  31. Pourjafari E, Mojallali H (2012) Solving nonlinear equations systems with a new approach based on invasive weed optimization algorithm and clustering. Swarm Evol Comput 4:33–43

    CrossRef  Google Scholar 

  32. Ramadas G, Fernandes E, Rocha A (2018) Finding multiple roots of systems of nonlinear equations by a hybrid harmony search-based multistart method. Appl Math Information Sci 12(1):21–32

    CrossRef  MathSciNet  Google Scholar 

  33. Reyes-Sierra S, Plata-Rueda J, Correa-Cely R (2012) Real and/or complex roots calculation of nonlinear equations systems through modified particle swarm optimization. Ingeniería y Universidad 16(2):349–362

    Google Scholar 

  34. Rice JR (1993) Numerical methods, software, and analysis, 3rd edn. Academic Press, Boston

    MATH  Google Scholar 

  35. Shi Y, Eberhart RC (1998) A modified particle swarm optimizer. In: IEEE World Congress on Computational Intelligence, WCCI. Anchorage, AK, USA, pp 69–73

    Google Scholar 

  36. Silva RM, Resende MG, Pardalos PM (2014) Finding multiple roots of a box-constrained system of nonlinear equations with a biased random-key genetic algorithm. J Global Optimization 60(2):289–306

    CrossRef  MathSciNet  MATH  Google Scholar 

  37. Suganthan PN (1999) Particle swarm optimiser with neighbourhood operator. In: IEEE Congress on Evolutionary Computation, CEC, vol 3. Washington, WA, , pp 1958–1962

    Google Scholar 

  38. Tsoulos I, Stavrakoudis A (2010) On locating all roots of systems of nonlinear equations inside bounded domain using global optimization methods. Nonlinear Anal: Real World Appl 11(4):2465–2471

    CrossRef  MathSciNet  MATH  Google Scholar 

  39. Turgut OE, Turgut MS, Coban MT (2014) Chaotic quantum behaved particle swarm optimization algorithm for solving nonlinear system of equations. Comput Math Appl 68(4):508–530

    CrossRef  MathSciNet  MATH  Google Scholar 

  40. Wang Q, Zeng J, Jie J (2007) Modified particle swarm optimization for solving systems of equations. In: International Conference on Intelligent Computing, ICIC, Qingdao, China, pp 361–369

    Google Scholar 

  41. Zhan Z, Zhang J, Li Y, Chung HS (2009) Adaptive particle swarm optimization. IEEE Trans Syst Man Cybernetics Part B (Cybernetics) 39(6):1362–1381

    Google Scholar 

  42. Zhang Y, Zeng Z (2009) A new method for simultaneous extraction of all roots of algebraic polynomial. In: International conference on Computational Intelligence and Security, CIS, vol 1. Beijing, China, pp 197–200

    Google Scholar 

  43. Zhao J, Sun J, Lai CH, Xu W (2011) An improved quantum-behaved particle swarm optimization for multi-peak optimization problems. Int J Comput Math 88(3):517–532

    CrossRef  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

This work was supported by the Project MITIExcell (Project—UIDB/50009/ 2020), co-financed by Regional Development European Funds for the “Operational Program Madeira 14–20”—Priority Axis 1 of the Autonomous Region of Madeira, Number M1420-01-0145-FEDER-000002. In addition, the funding from LARSyS–FCT Pluriannual funding 2020–2023 is acknowledged.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Diogo Nuno Freitas .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Freitas, D.N., Lopes, L.G., Morgado-Dias, F. (2022). MRF–PSO: MultiRoot Finding Particle Swarm Optimization Algorithm for Nonlinear Functions. In: Pandit, M., Gaur, M.K., Rana, P.S., Tiwari, A. (eds) Artificial Intelligence and Sustainable Computing. Algorithms for Intelligent Systems. Springer, Singapore. https://doi.org/10.1007/978-981-19-1653-3_32

Download citation