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

Gonos, IF; Mastorakis, NE; Swamy, MNS

dc.contributor.author	Gonos, IF	en
dc.contributor.author	Mastorakis, NE	en
dc.contributor.author	Swamy, MNS	en
dc.date.accessioned	2014-03-01T01:18:31Z
dc.date.available	2014-03-01T01:18:31Z
dc.date.issued	2003	en
dc.identifier.issn	1057-7122	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/15062
dc.subject	Genetic algorithm (GA)	en
dc.subject	Multidimensional (m-D) polynomial factorization	en
dc.subject	Multivariate polynomials	en
dc.subject.classification	Engineering, Electrical & Electronic	en
dc.subject.other	Genetic algorithms	en
dc.subject.other	Partial differential equations	en
dc.subject.other	Signal processing	en
dc.subject.other	Wave filters	en
dc.subject.other	Factorization	en
dc.subject.other	Polynomials	en
dc.title	A genetic algorithm approach to the problem factorizatlon of general multidimensional polynomials	en
heal.type	journalArticle	en
heal.identifier.primary	10.1109/TCSI.2002.807503	en
heal.identifier.secondary	http://dx.doi.org/10.1109/TCSI.2002.807503	en
heal.language	English	en
heal.publicationDate	2003	en
heal.abstract	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.	en
heal.publisher	IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC	en
heal.journalName	IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications	en
dc.identifier.doi	10.1109/TCSI.2002.807503	en
dc.identifier.isi	ISI:000180980700002	en
dc.identifier.volume	50	en
dc.identifier.issue	1	en
dc.identifier.spage	16	en
dc.identifier.epage	22	en