Symbolic computation of the Duggal transform

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 characteristics. The introduced algorithm is proven and illustrated in numerical examples. We also represent symbolically the Duggal transform of rank-one matrices using cross products of vectors and show that the Duggal transform of such matrices can be given explicitly by a closed formula and is equal to its Aluthge transform.