The week's pick
Random Articles
Reseach Article
Parallel Algorithm for Finding Inverse of a Matrix and its Application in Message Sharing (Coding Theory)
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 136 - Number 9 |
| Year of Publication: 2016 |
| Authors: Shruti Saraf, Swati Dhingra, Greetta Pinheiro |
10.5120/ijca2016908569
|
Shruti Saraf, Swati Dhingra, Greetta Pinheiro . Parallel Algorithm for Finding Inverse of a Matrix and its Application in Message Sharing (Coding Theory). International Journal of Computer Applications. 136, 9 ( February 2016), 24-28. DOI=10.5120/ijca2016908569
Abstract
A parallel algorithm for finding the inverse of the matrix using Gauss Jordan method in OpenMP. The Gauss Jordan method has been chosen for this project because it provides a direct method for obtaining inverse matrix and requires approx. 50% fewer operations unlike other methods. Hence forth it is suitable for massive parallelization. Then, authors have analyzed the parallel algorithm for computing the inverse of the matrix and compared it with its perspective sequential algorithm in terms of run time, speed-up and efficiency. Further, the obtained result is used to propose a new method of Message Sharing (called Coding Theory). The proposed method is simple and has a great potential to be applied to other situation where the exchange of messages is done confidentially such as in military operation, banking transactions etc.
References
- S.F.McGinn, R.E.Shaw, “Parallel Gaussian Elimination Using OpenMP and MPI”,Proceedings of the 16th Annual International Symposium on High Performance Computing Systems and Applications (HPCS’02) 0-7695-1626-2/02,2002
- Karen H. Warren, Eugune D. Brooks III, “Gauss Elimination: A case study on Parallel machines”, Massive parallel computing initiative, Lawrence Livermore National Laboratory, CA 94550
- Martin Hudik,Michal Hodon,“Modelling, optimization and performance prediction of parallel algorithms”, European Regional Development Fund and the Slovak state budget for the project ”Research Centre of University of Zilina”, ITMS 26220220183
- MartinHudik, Michal Hodon,“Performance optimization of parallel algorithm”,Journal Of Communications And Networks, Vol. 16, No. 4, August 2014
- “Inverse and determinant of a square matrix by order expansion and condesation”
- Aravindh Krishnamoorthy, Deepak Menon, “Matrix inversion using cholesky decomposition”, IEEE-SPA 2013 September 26-28, Poznan, Poland, 2013
- "Applications of Matrices and Determinants", http://www. richland.edu / james /lecture /.../matrices/applications.html. 2015
- "Matrices- Applications to Crytography", http://aix1.uottawa.ca/~jkhoury/cryptography.htm
- Girish Sharma , Abhishek Agarwala , Baidurya Bhattacharya, "A fast parallel Gauss Jordan algorithm for matrix inversion using CUDA", Computers and Structures 128 (2013) 31–37
- Sami Almalki, Saeed Alzahrani, Abdullatif Alabdullatif, " New parallel algorithms for finding determinants of NxN matrices", Proceedings of the Computer and Information Technology (WCCIT) IEEE, 2013
- Balakrishnan Vellaikannan, Dr. V. Mohan, "A Novel Method for Coding Theory With the Help of a Class of Matrices", World Applied Programming, Vol (1), No (5), December 2011. 339-345
- Sadiq Shehu, "Application of Matrices to Cryptography", http://www.academia.edu/8377683/APPLICATION_OF_CRYPTOGRAPHY_IN_MATRICE
- B.Vellaikannan,Dr.V.Mohan,V.Gnanaraj, " A NOTE ON THE APPLICATION OF QUADRATIC FORMS IN CODING THEORY WITH A NOTE ON SECURITY", Int. J. Comp.Tech. Appl,Vol 1 (1), 78-87
Index Terms
Keywords