In this note we characterize polynomial numerical hulls of matrices $A in M_n$ such that$A^2$ is Hermitian. Also, we consider normal matrices $A in M_n$ whose $k^{th}$ power are semidefinite. For such matriceswe show that $V^k(A)=sigma(A)$.

An involution or anti-involution is a self-inverse linear mapping. In this paper, we will present two real quaternion matrices, one corresponding to a real quaternion involution and one corresponding to a real quaternion anti-involution. Moreover, properties and geometrical meanings of these matrices will be given as reflections in R^3.

In this paper, we present a new computational method to solve Volterra integral equations of the first kind based on Bernstein polynomials. In this method, using operational matrices turn the integral equation into a system of equations. The computed operational matrices are exact and new. The comparisons show this method is acceptable. Moreover, the stability of the proposed method is studied.

In this paper, we investigate the reduced form of circulant matrices and we show that the problem of computing the q-th roots of a nonsingular circulant matrix A can be reduced to that of computing the q-th roots of two half size matrices B - C and B + C.

in this paper, some elementary operations on triangular fuzzynumbers (tfns) are defined. we also define some operations on triangularfuzzy matrices (tfms) such as trace and triangular fuzzy determinant(tfd). using elementary operations, some important properties of tfms arepresented. the concept of adjoints on tfm is discussed and some of theirproperties are. some special types of tfms (e.g. pu...

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