AbstractAccording to Aitken, a “retrocirculant” is the product of a circulant and a certain permutation matrix P. In [1], he determined the eigenvalues of the retrocirculants. In his proof, he used PΩ = ΩP where Ω is a certain unitary matrix. Here we present a necessary and sufficient condition for a permutation matrix to commute with Ω. We also determine the eigenvalues of many retrocirculants
AbstractIf R is an n × n matrix over the complex field which is the product of a diagonal matrix D a...
AbstractEffective numerical algorithms for circulant-block matrices A whose blocks are circulant are...
AbstractIf N is normal and invertible, the matrices A with N∗AN = ϱA for various ϱ span all matrices...
AbstractAccording to Aitken, a “retrocirculant” is the product of a circulant and a certain permutat...
AbstractWe study the properties of matrices of the form P(σ)A where σ is induced by an automorphism ...
AbstractIn this note we show that the eigenvectors of circulant matrices of prime dimension can be e...
AbstractLet P be an n×n permutation matrix, and let p be the corresponding permutation. Let A be a m...
AbstractIn [2] some theorems on n × n circulant matrices were introduced under the hypothesis n a pr...
AbstractIn [5], a class Σ of p×p circulant matrices was studied where p is a prime, and necessary an...
AbstractIf R is an n × n matrix over the complex field which is the product of a diagonal matrix D a...
AbstractA class Σ of matrices is studied which contains, as special subclasses, p-circulant matrices...
AbstractIn this paper we investigate generalized circulant permutation matrices of composite order. ...
AbstractThe spectral theory for circulants over R or C is discussed, followed by a discussion of inv...
AbstractThe determinant of the circulant matrix whose first row is a0, a1,…, an−1 is a homogeneous p...
AbstractIn this paper, we will study the h-circulants which satisfy the matrix equation Am = λJ of n...
AbstractIf R is an n × n matrix over the complex field which is the product of a diagonal matrix D a...
AbstractEffective numerical algorithms for circulant-block matrices A whose blocks are circulant are...
AbstractIf N is normal and invertible, the matrices A with N∗AN = ϱA for various ϱ span all matrices...
AbstractAccording to Aitken, a “retrocirculant” is the product of a circulant and a certain permutat...
AbstractWe study the properties of matrices of the form P(σ)A where σ is induced by an automorphism ...
AbstractIn this note we show that the eigenvectors of circulant matrices of prime dimension can be e...
AbstractLet P be an n×n permutation matrix, and let p be the corresponding permutation. Let A be a m...
AbstractIn [2] some theorems on n × n circulant matrices were introduced under the hypothesis n a pr...
AbstractIn [5], a class Σ of p×p circulant matrices was studied where p is a prime, and necessary an...
AbstractIf R is an n × n matrix over the complex field which is the product of a diagonal matrix D a...
AbstractA class Σ of matrices is studied which contains, as special subclasses, p-circulant matrices...
AbstractIn this paper we investigate generalized circulant permutation matrices of composite order. ...
AbstractThe spectral theory for circulants over R or C is discussed, followed by a discussion of inv...
AbstractThe determinant of the circulant matrix whose first row is a0, a1,…, an−1 is a homogeneous p...
AbstractIn this paper, we will study the h-circulants which satisfy the matrix equation Am = λJ of n...
AbstractIf R is an n × n matrix over the complex field which is the product of a diagonal matrix D a...
AbstractEffective numerical algorithms for circulant-block matrices A whose blocks are circulant are...
AbstractIf N is normal and invertible, the matrices A with N∗AN = ϱA for various ϱ span all matrices...