ملخص: The factorization (root finding) of scalar polynominals 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 polynomials. The main contributions of this thesis can be summarized as follows : 1- the development of the Q.D. algorithm, which is a global method capable of producing a complete factorization of a matrix polynomial; 2- establishment of an existence theorem for the Q.D. algorithm; 3- production of convergence theorems for the Q.D. algorithm; 4- study of the initialization of the algorithm; 5- applicability of Broyden's method to matrix polynomial problems. As a by-product, some important results have been produced: 6- localisation of the latent roots of a matrix polynomial in the complex plane; 7- Investigation of the existence of the solvents of a monic matrix polynomial; 8- derivation of an oncomplete partial fraction expansion of a matrix rational fraction.

طبعة: Boumerdes: National Institute of Electricity and Electronics
لغة: إنجليزية
الوصف المادي: 142 p. ill. ;30 cm
الشهادة: Magister
مؤسسة مناقشة الرسالة: National Institute of Electricity and Electronics

ملاحظة: Bibliogr.pp.138-142