English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

One of the most significant challenges in Computing Determinant ofRectangular Matrices is high time complexity of its algorithm. Among alldefinitions of determinant of rectangular matrices, used definition has specialfeatures which make it more notable. But in this definition, C(n m) submatrices of the order m*m needed to be generated that put this problem in NPhard class. On the other hand, any row or column reduction operation may hardlylead to diminish the volume of calculation. Therefore, in this paper we try topresent the parallel algorithm which can decrease the time complexity ofcomputing the determinant of non-square matrices to O(pow(n,2)).

An efficient parallel algorithm for computing determinant of non square matrices