文章基本信息

标题：An Efficient Parallel Algorithm for Computing Determinant of Non-Square Matrices Based on Radic's Definition
本地全文：下载
作者：Neda Abdollahi ; Mohammad Jafari ; Morteza Bayat 等
期刊名称：International Journal of Distributed and Parallel Systems
印刷版ISSN：2229-3957
电子版ISSN：0976-9757
出版年度：2015
卷号：6
期号：4
页码：1
DOI：10.5121/ijdps.2015.6401
出版社：Academy & Industry Research Collaboration Center (AIRCC)
摘要：One of the most significant challenges in Computing Determinant of Rectangular Matrices is high timecomplexity of its algorithm. Among all definitions of determinant of rectangular matrices, Radic’sdefinition has special features which make it more notable. But in this definition, C(NM) sub matrices of theorder m×m needed to be generated that put this problem in np-hard class. On the other hand, any row orcolumn reduction operation may hardly lead to diminish the volume of calculation. Therefore, in this paperwe try to present the parallel algorithm which can decrease the time complexity of computing thedeterminant of non-square matrices to O(N).
关键词：Parallel algorithm; Non-square determinant; Ascending sequence; Dictionary order.