By Topic

A genetic algorithm approach to the problem of factorization of general multidimensional polynomials

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Gonos, I.F. ; High Voltage Lab., Nat. Tech. Univ. of Athens, Greece ; Mastorakis, N.E. ; Swamy, M.N.S.

In this paper, a solution to the problem of the multidimensional (m-D) polynomial factorization is attempted by using genetic algorithms (GAs). The proposed method is based on an appropriate minimization of the norm of the difference between the original polynomial and its desirable factorized form. Using GAs, we can obtain better results than with other methods of minimization (numerical techniques, neural networks, etc.). The present methodology, which can also be used for every type of m-D factorization, is illustrated by means of a numerical example.

Published in:

Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on  (Volume:50 ,  Issue: 1 )