This document presents a new parallel algorithm for evaluating the determinant of a matrix of order n based on a new recursive idea. The algorithm uses a mesh architecture with CREW shared memory. It has three steps - a sequential loop of order O(n), and two parallel loops of order O(1). This gives the new algorithm a time complexity of O(n). With pipelining, the algorithm can achieve an efficiency of O(n+k*k). The paper also provides examples of calculating determinants of 3x3 and 4x4 matrices using the new approach.
This document presents a new parallel algorithm for evaluating the determinant of a matrix of order n based on a new recursive idea. The algorithm uses a mesh architecture with CREW shared memory. It has three steps - a sequential loop of order O(n), and two parallel loops of order O(1). This gives the new algorithm a time complexity of O(n). With pipelining, the algorithm can achieve an efficiency of O(n+k*k). The paper also provides examples of calculating determinants of 3x3 and 4x4 matrices using the new approach.
This document presents a new parallel algorithm for evaluating the determinant of a matrix of order n based on a new recursive idea. The algorithm uses a mesh architecture with CREW shared memory. It has three steps - a sequential loop of order O(n), and two parallel loops of order O(1). This gives the new algorithm a time complexity of O(n). With pipelining, the algorithm can achieve an efficiency of O(n+k*k). The paper also provides examples of calculating determinants of 3x3 and 4x4 matrices using the new approach.
Islamic Azad university of Zanjan,Zanjan ,Iran Institute for Advanced Studies in Basic Sciences,Zanjan,Iran A.Amiri and E.Sarijloo Iran university of Sience and Technology Islamic Azad university of Zanjan,Zanjan ,Iran In This Paper ……..
• Present a New Recursive Idea for
Evaluation of Determinant of Order n • Design a New Parallel Algorithm based on New Method • The efficiency of New Algorithm • Pipeline and its effect on Algorithm efficiency a New Recursive Idea for Evaluation of Determinant of Order n • This approach has been introduced for the first time in [5,6] • Before going through the details of methods and proof we show how to use this new approach to evaluate Determinant of matrix of size 3*3 and 4*4 Determinant of matrix of size 3*3 and 4*4 in new ……..
• Matrix of size 3*3
Determinant of matrix of size 3*3 and 4*4 in new ……..Cont. • Matrix of size 4*4 General Theorem of New Approach
• Let M=[aij] be a square matrix of order
n,then: New Parallel Algorithm based on New Method • H.W:a n*n Mesh Architecture With CREW Shared Memory New Parallel Algorithm ….Cont.
• In each step Pij must compute the following
task: New Parallel Algorithm ….Cont. Analysis of Algorithm
• The algorithm has 3 loop:
1. A sequential loop with order of O(n) 2. Two parallel algorithm with order of O(1) So the Time Complexity of New Algorithm is: O(n) For Pipeline approach the algorithm can reach to O(n+k*k) efficiency References • [1] P. A. Samuelson, A method of determining explicitly the coefficients of the characteristic polynomials,Ann. Math. Stat., 13 (1942) 424- 429. • [2] L. Csanky, Fast parallel inversion algorithm , SIAM J. Comput., 5 (1976) 618- 623. • [3] A. L. Chistov, Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic, in Proc. Int. Conf. Foundations of Computation Theory, Lecture Notes in Comput. Sci.199, Speringer-Verlag, New York, Berlin, 1985, 63-69. • [4] S. J. Berkowitz, On computing the determinant in small parallel time using a small number of processors, Inform. Process. Lett., 18 (1984) 147-150. • [5] S. M. H. Mousavi, A New method for calculating n*n determinants, Majaleyeh Ryazieh Borhan(Persian Language), 34 (2001) 42-46. • [6] H. Teimoori and M. Bayat, A Recursive method for evaluating of determinants, Submitted,(2005). [7] Donald E. Knuth, Overlapping Pfaffians, Electronic Journal of Combinatorics, 3 (2) (1996)1-13. [8] C. L. Dodgson, Condensation of Determinants: Being a New and Brief Method for Computing their Arithmetic Values, Proc. Roy. Soc. Ser. A, 15 (1866)150-155.