Search In this Thesis
   Search In this Thesis  
العنوان
New Technique for Computation in Electrical Networks and Applications \
المؤلف
Abou Zeid, Ali Zo El-Fakkar Mostafa.
هيئة الاعداد
باحث / علي ذو الفقار مصطفى ابوزيد
الموضوع
Electrical Networks
تاريخ النشر
1974.
عدد الصفحات
80 p. :
اللغة
الإنجليزية
الدرجة
الدكتوراه
التخصص
الهندسة الميكانيكية
تاريخ الإجازة
1/1/1974
مكان الإجازة
جامعة القاهرة - كلية الهندسة - الطاقة الكهربائية وقسم الآلات
الفهرس
Only 14 pages are availabe for public view

from 85

from 85

Abstract

Recent developments in both the hardware end software or digital computers are so at that the cost per computation is decreasing at a fast rate. Despite or this fact, refinements in the computer methods in order to reduce memory and/or time requirement, for a certain computation, are still of vital importance, This is specially true for real time application.
Almost all computational effort in linear, electrical networks, as a digital application, was directed towards the power field. Although relations in the power network itself are linear , yet conditions imposed on the network re usually nonlinear are An analytical solution in such a case is practically impossible. A wide class of power system analysis problems, that involves the power network, was thus solved by iteration, Improvements in the methods of solving such a class of problems were made either in the network representing table or the iterative method itself.
The bus admittance matrix1, well contained impedance matrices2, or the hybrid matrices3 have been used successfully for representing the power network for such iterative solutions. However recent trends were to sake use of network representation tables, that enabled the application of sparsity techniques in such solutione4’5’6. For a normal power network the bus impedance matrix is highly sparse, while the bus impedance matrices are generally nonsparse, Spsraity techniques, illustrated in app erdix I, were directly applied to sparse network equations in order to put them in compact table form, rather than normal matrix form. A linear relation between storage requirements and the number of equations was achieved by such a technique rather than the usual parabolic relation in the matrix cases. Mean while in order to make use of their highly sparse inverses, bus impedance matrices or similar network matrices, were handled as compact decomposition tables obtained from the corresponding bun admittance matrices4 Such a technique. was also applied in case