let $r=k[x_1,x_2,cdots, x_n]$ be a polynomial ring over a field $k$. we prove that for any positive integers $m, n$, $text{reg}(i^mj^nk)leq mtext{reg}(i)+ntext{reg}(j)+text{reg}(k)$ if $i, j, ksubseteq r$ are three monomial complete intersections ($i$, $j$, $k$ are not necessarily proper ideals of the polynomial ring $r$), and $i, j$ are of the form $(x_{i_1}^{a_1}, x_{i_2}^{a_2}, cdots, x_{i_l...

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...

Matrix functions are used in many areas of linear algebra and arise in numerical applications in science and engineering. In this paper, we introduce an effective approach for determining matrix function f(A)=g(q(A)) of a square matrix A, where q is a polynomial function from a degree of m and also function g can be a transcendental function. Computing a matrix function f(A) will be time- consu...