University timetabling is an issue that has received more attention in the field of operations research. Course scheduling process arranging time slots and room for a class by paying to existing limitations. This problem NP-Hard problem, which means computation find solution increases exponentially with size problem. Solutions problems this kind generally use heuristic approach, tries sufficien...

Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...