Applied Mathematical Sciences, Vol. 11, 2017, no. 36, 1793 - 1801 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ams.2017.75187 The Technique ”Evaluation-Interpolation” in Parallel Processing with Matlab Dimitris Varsamis Department of Informatics Engineering, Technological Educational Institute of Central Macedonia - Serres 62124, Serres, Greece Copyright c  2017 Dimitris Varsamis. This article is distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduc- tion in any medium, provided the original work is properly cited. Abstract In this paper a new parallel algorithm for the computation of the inverse of a bivariate polynomial matrix are presented. The parallel algorithm based on the technique evaluation-interpolation and for the part of interpolation uses the Newton bivariate polynomial interpola- tion. The algorithm is applied to the programming environment of MATLAB with Parallel Computing Toolbox and is compared to the corresponding build-in function of MATLAB inv(). Keywords: Parallel Algorithm, Bivariate polynomial interpolation, Evaluation- Interpolation, Matlab PCT 1 Introduction The problem of computing the inverse of a polynomial matrix has been consid- ered by many authors due to its large number of applications i.e. calculation of the transfer function matrix of a system [2], solution of Auto-Regressive equa- tions [1], coding and cryptography [5] etc. The inverse of a polynomial matrix can be computed either by using symbolic algorithms, like the Leverrier-Faddev algorithm [4], or numerical algorithms [3, 10, 6, 9]. Among those algorithms it is shown that DFT interpolation techniques are the most promising as con- cerns the running time, in contrast to the symbolic ones which are accurate but time consuming. In order to compute the inverse of a polynomial matrix,