Complexity of parallel block Gauss Jordan algorithm
Other Title(s)
تعقيدات القطاعات المتوازية الخوارزمية جاوس جوردون
Parallel Title
تعقيدات القطاعات المتوازية الخوارزمية جاوس جوردون
Author
Source
Arab Journal of Basic and Applied Sciences
Issue
Vol. 7, Issue 0 (30 Nov. 2008), pp.57-65, 9 p.
Publisher
University of Bahrain College of Science
Publication Date
2008-11-30
Country of Publication
Bahrain
No. of Pages
9
Main Subjects
Topics
Abstract AR
في هذا البحث، تم استعراض خوارزمية جاوس جوردن لحل منظومة المعادلات الخطية باستخدام الحاسبات المتوازية (عند توفر أكثر من معالج واحد في البرمجة الخوارزمية قد غير نظرتنا في إيجاد حلول للمنظومة الخطية).
Abstract EN
In this paper the block Gauss-Jordan algorithm for solving linear systems of equations is presented in the proposed for multitasking.
The paper indicates how the availability of more than one processor must change our approach to the problem of computing solutions of linear systems.
American Psychological Association (APA)
Abbas, Salman H.. 2008. Complexity of parallel block Gauss Jordan algorithm. Arab Journal of Basic and Applied Sciences،Vol. 7, no. 0, pp.57-65.
https://search.emarefa.net/detail/BIM-64025
Modern Language Association (MLA)
Abbas, Salman H.. Complexity of parallel block Gauss Jordan algorithm. Arab Journal of Basic and Applied Sciences Vol. 7 (Nov. 2008), pp.57-65.
https://search.emarefa.net/detail/BIM-64025
American Medical Association (AMA)
Abbas, Salman H.. Complexity of parallel block Gauss Jordan algorithm. Arab Journal of Basic and Applied Sciences. 2008. Vol. 7, no. 0, pp.57-65.
https://search.emarefa.net/detail/BIM-64025
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references : p. 63-64
Record ID
BIM-64025
