The division free parallel algorithm for finding determinant
A cross multiplication method for determinant was generalized for any size of square matrices using a new permutation strategy.The permutation is generated based on starter sets.However, via permutation, the time execution of sequential algorithm became longer.Thus, in order to reduce the computatio...
محفوظ في:
| المؤلفون الرئيسيون: | , , |
|---|---|
| التنسيق: | مقال |
| اللغة: | English |
| منشور في: |
Pushpa Publishing House
2013
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | http://repo.uum.edu.my/16849/1/9.pdf http://repo.uum.edu.my/16849/ http://www.pphmj.com/journals/articles/1117.htm |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| الملخص: | A cross multiplication method for determinant was generalized for any size of square matrices using a new permutation strategy.The permutation is generated based on starter sets.However, via permutation, the time execution of sequential algorithm became longer.Thus, in order to reduce the computation time, a parallel strategy was developed which is suited for master and slave paradigm of the high performance computer.A parallel algorithm is integrated with message passing interface.The numerical results showed that the parallel methods computed the determinants faster than the sequential
counterparts particularly when the tasks were equally allocated. |
|---|