FACTORIZATION OF M-D POLYNOMIALS IN LINEAR M-D FACTORS

 
see the original item page
in the repository's web site and access all digital files if the item*
share




1992 (EN)

FACTORIZATION OF M-D POLYNOMIALS IN LINEAR M-D FACTORS (EN)

THEODOROU, NJ (EN)
MASTORAKIS, NE (EN)
TZAFESTAS, SG (EN)

This paper presents a solution to the factorization problem of high-order m-D polynomials into special m-D factors that are linear in all variables. By special it is meant that the factors have the form of a sum of one independent variable, say z1, and a general first-order polynomial not involving z1, i.e. z1 + a(j)2z2 + ... + a(jm)z(m) (j = 1, 2,..., N1). Two theorems providing the necessary and sufficient conditions for this factorization are given, which have an algorithmic form and are thus appropriate for direct computer use. The results are illustrated by means of three examples. (EN)

journalArticle (EN)

Operations Research & Management Science (EN)
Automation & Control Systems (EN)
Computer Science, Theory & Methods (EN)
SYSTEMS (EN)
STATE-SPACE (EN)


INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE (EN)

English

1992 (EN)

11 (EN)
23 (EN)
10.1080/00207729208949423 (EN)
ISI:A1992KB36900002 (EN)
1805 (EN)
1824 (EN)
0020-7721 (EN)

TAYLOR & FRANCIS LTD (EN)




*Institutions are responsible for keeping their URLs functional (digital file, item page in repository site)