Algorithms for the factorization of matrix polynomials
| dc.contributor.author | Dahimene, Abdelhakim | |
| dc.date.accessioned | 2015-06-07T14:48:11Z | |
| dc.date.available | 2015-06-07T14:48:11Z | |
| dc.date.issued | 1992 | |
| dc.description | 142 p. : ill. ; 30 cm | en_US |
| dc.description.abstract | The factorization (root finding) of scalar polynomials is an important tool of analysis and design for linear systems. This thesis is a part of an ongoing effort to generalize these tools to multivariable systems via the factorization of matrix polynimials. The main contribution of this thesis can be summarized as follows... | en_US |
| dc.identifier.uri | https://dspace.univ-boumerdes.dz123456789/1454 | |
| dc.language.iso | en | en_US |
| dc.subject | Polynômes matriciels | en_US |
| dc.subject | Factorisation (Mathematics) | en_US |
| dc.subject | Algorithms | en_US |
| dc.subject | Factorization | en_US |
| dc.title | Algorithms for the factorization of matrix polynomials | en_US |
| dc.type | Thesis | en_US |