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...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Pushpa Publishing House
2013
|
Subjects: | |
Online Access: | https://repo.uum.edu.my/id/eprint/16849/1/9.pdf |
_version_ | 1803627267847356416 |
---|---|
author | Karim, Sharmila Omar, Zurni Ibrahim, Haslinda |
author_facet | Karim, Sharmila Omar, Zurni Ibrahim, Haslinda |
author_sort | Karim, Sharmila |
collection | UUM |
description | 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. |
first_indexed | 2024-07-04T06:03:21Z |
format | Article |
id | uum-16849 |
institution | Universiti Utara Malaysia |
language | English |
last_indexed | 2024-07-04T06:03:21Z |
publishDate | 2013 |
publisher | Pushpa Publishing House |
record_format | dspace |
spelling | uum-168492016-01-07T04:30:17Z https://repo.uum.edu.my/id/eprint/16849/ The division free parallel algorithm for finding determinant Karim, Sharmila Omar, Zurni Ibrahim, Haslinda QA Mathematics 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. Pushpa Publishing House 2013 Article PeerReviewed application/pdf en https://repo.uum.edu.my/id/eprint/16849/1/9.pdf Karim, Sharmila and Omar, Zurni and Ibrahim, Haslinda (2013) The division free parallel algorithm for finding determinant. Far East Journal of Mathematical Sciences (FJMS), 79 (1). pp. 105-122. ISSN 0972-0871 http://www.pphmj.com/journals/articles/1117.htm |
spellingShingle | QA Mathematics Karim, Sharmila Omar, Zurni Ibrahim, Haslinda The division free parallel algorithm for finding determinant |
title | The division free parallel algorithm for finding determinant |
title_full | The division free parallel algorithm for finding determinant |
title_fullStr | The division free parallel algorithm for finding determinant |
title_full_unstemmed | The division free parallel algorithm for finding determinant |
title_short | The division free parallel algorithm for finding determinant |
title_sort | division free parallel algorithm for finding determinant |
topic | QA Mathematics |
url | https://repo.uum.edu.my/id/eprint/16849/1/9.pdf |
work_keys_str_mv | AT karimsharmila thedivisionfreeparallelalgorithmforfindingdeterminant AT omarzurni thedivisionfreeparallelalgorithmforfindingdeterminant AT ibrahimhaslinda thedivisionfreeparallelalgorithmforfindingdeterminant AT karimsharmila divisionfreeparallelalgorithmforfindingdeterminant AT omarzurni divisionfreeparallelalgorithmforfindingdeterminant AT ibrahimhaslinda divisionfreeparallelalgorithmforfindingdeterminant |