A Genetic algorithm for evaluating the zeros (roots) of polynomial functions, optimizing and solving n-dimensional systems of equations
This paper presents a Genetic Algorithm software (which is a computational, search technique) for finding the zeros (roots) of any given polynomial function, and optimizing and solving N-dimensional systems of equations. The software is particularly useful since most of the classic schemes are not all embracing. For example; Newton-Raphson Scheme can only solve the zeros (roots) of polynomial, while and Gauss-Jordan scheme can only solve set of linear simultaneous equations. This characteristics of classical schemes, thus pose a limitation to the scope of problems they can they can used to solve. This limitation is effectively and accurately easily resolved using the genetic algorithm programme. It is demonstrated using a number of examples . Thus it solves a wider class of optimization problems, and also solves for the zeros or roots of polynomial. The program was designed and implemented using Microsoft Visual Basic object oriented programming Language.
JONAMP Vol. 11 2007: pp. 213-222