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

we study the set of all determinants of adjacency matrices of graphs with a given number of vertices. using brendan mckay's data base of small graphs, determinants of graphs with at most $9$ vertices are computed so that the number of non-isomorphic graphs with given vertices whose determinants are all equal to a number is exhibited in a table. using an idea of m. newman, it is proved that if $...

the subgroups of symplectic groups which fix a non-zero vector of the underlying symplectic space are called affine subgroups., the split extension group $a(4)cong 2^7{:}sp_6(2)$ is the affine subgroup of the symplectic group $sp_8(2)$ of index $255$‎. ‎in this paper‎, ‎we use the technique of the fischer-clifford matrices to construct the character table of the inertia group $2^7{:}o^{-}_{6}(2...

in this paper a guided tabu search (gts) is utilized for optimal nodal ordering of finite element models (fems) leading to small profile for the stiffness matrices of the models. the search strategy is accelerated and a graph-theoretical approach is used as guidance. the method is evaluated by minimization of graph matrices pattern equivalent to stiffness matrices of finite element models. comp...