Complexity Analysis of Vedic Mathematics Algorithms for Multicore Environment

The huge computations performed sequentially requires a lot of time for execution as on contrary to the concurrent implementation. Many problems are involved in the dense linear algebra operations the main focus for this work is for solving linear equations. The problem of solving linear equations when approached using parallel implementation will yield better results. The Vedic mathematical method of Paravartya Yojayet is having less complexity as compared to the conventional methods. This work mainly focuses on the parallel implementation of the Paravartya Yojayet and its comparison to the benchmarking of the existing LU decomposition. The results of this implementation of Paravartya Yojayet are better when analysed theoretically but its actual parallel implementation will vary so it needs to be analysed and this work presents the same. The comparative analysis of the two ways for parallelization of the Paravartya Yojayet methods viz. ‘For loop' parallelization and the ‘direct parallelization' is also analysed in this work.