Computer algorithms symbolic inversion of polynomial matrices

مقدم أطروحة جامعية

Ali, Gehni Ahmad

الجامعة

الجامعة التكنولوجية

الكلية

-

القسم الأكاديمي

قسم الهندسة الكهربائية

دولة الجامعة

العراق

الدرجة العلمية

ماجستير

تاريخ الدرجة العلمية

1998

الملخص الإنجليزي

In this work, two methods for obtaining network functions (for general electronic networks) in symbolic form are presented both methods are based on fast and efficient algorithms for the inversion of multidimensional polynomial matrices In the first method, the inverse of constant coefficient matrix most be exist preapplying the algorithm, else some modifications must be done on (ins coefficient matrix to make it intertable.

While In the second method the inversion algorithm is applied directly without any conditions on the coefficient matrices both algorithms utilize operations on constant matrices only.

The developed algorithms give the solution as a ratio of two polynomials in which the coefficients arc of mixed variety, the values of most, but not all of components having been included in the calculation.

The number of variables which will be kept as variables is up to five variables only.

Therefore, this work may he classified under the symbolic analysis field (semi-symbolic type of solution).

The sensitivity of the network with respect to the variable elements is also calculated.

Many programs arc written in turbo Pascal to simulate the developed algorithms.

التخصصات الرئيسية

تكنولوجيا المعلومات وعلم الحاسوب

• APA
• MLA
• AMA

لغة النص

الإنجليزية

نوع البيانات

رسائل جامعية

رقم السجل

BIM-306328