Nature-Inspired Algorithms for Solving Some Hard Numerical Problems

Nature-Inspired Algorithms for Solving Some Hard Numerical Problems

Abstract — MSc thesis

Optimisation is a branch of mathematics that was developed to find the optimal solutions, among all the possible ones, for a given problem. Applications of optimisation techniques are currently employed in engineering, computing, and industrial problems. Therefore, optimisation is a very active research area, leading to the publication of a large number of methods to solve specific problems to its optimality.

This dissertation focuses on the adaptation of two nature inspired algorithms that, based on optimisation techniques, are able to compute approximations for zeros of polynomials and roots of non-linear equations and systems of non-linear equations.

Although many iterative methods for finding all the roots of a given function already exist, they usually require: (a) repeated deflations, that can lead to very inaccurate results due to the problem of accumulating rounding errors, (b) good initial approximations to the roots for the algorithm converge, or (c) the computation of first or second order derivatives, which besides being computationally intensive, it is not always possible.

The drawbacks previously mentioned served as motivation for the use of Particle Swarm Optimisation (PSO) and Artificial Neural Networks (ANNs) for root-finding, since they are known, respectively, for their ability to explore high-dimensional spaces (not requiring good initial approximations) and for their capability to model complex problems. Besides that, both methods do not need repeated deflations, nor derivative information.

The algorithms were described throughout this document and tested using a test suite of hard numerical problems in science and engineering. Results, in turn, were compared with several results available on the literature and with the well-known Durand–Kerner method, depicting that both algorithms are effective to solve the numerical problems considered.

More information

Authors
Diogo Freitas; Luiz Guerreiro Lopes; Fernando Morgado-Dias
Date
2020
Source
Link

Citation

@mastersthesis{freitas2020,
 author = {Freitas, D.},
 month = {10},
 school = {Universidade da Madeira},
 title = {Nature-Inspired Algorithms for Solving Some Hard Numerical Problems},
 year = {2020}
}

© 2023. All rights reserved.

Powered by Hydejack v9.1.6