Some results on certain generalized circulant matrices
type: Item
instance of: scholarly article
title: Some results on certain generalized circulant matrices
zbMATH Open document ID: 1315.15004
author: Chengbo Lu
published in: Numerical Algorithms
publication date: 2015-03-23T00:00:00Z
review text: An \(m \times n\) \((m\leq n)\) matrix \(A=[a_{ij}]\) is called \((h,r)\)-circulant if for each row \(i\) \((i\geq 2 )\), \(a_{ij} = a_{i-1, j-h}\), where \(j > h\) and the last \(h\) entries of the preceding row are multiplied by \(r\). It is called \(h\)-circulant and \(r\)-circulant, when \(h=1\) and \(r=1\), respectively. If \((a_{0}, a_{1},\dots,a_{n-1})\) is the first row of an \(r\)-circulant matrix \(A\) of order \(n\), then the matrix \(A\) can be written as \(A=\sum_{i=0}^{n-1}a_{i}P^{i}_{n}(r)\), where \(P_{n}(r)\) is the \(r\)-circulant matrix of order \(n\) with the first row \((0, 1, 0, \dots, 0)\). An \(n\times n\) matrix \(A\) is called \((h,r)\)-generalized circulant if it can be partitioned into \(k\) sub-matrices of order \(m\times n\) \((h,r)\)-circulant matrices, where \( 1\leq h<n\), \(k=(n,h)\), \(n=km\) and \(h=kh'\) for positive integers \(h,n\). The first set of results concerns the generalized \((h,r)\)-circulant matrices. Theorem 1 gives a characterization of this type of circulant matrices. The result is then used in Theorem 2 to show that an \(r\)-circulant matrix \(A=\sum_{i=0}^{t}a_{i}P^{ih}(r)\) is similar to a \(k\)-block diagonal matrix, \[ \text{diag} \left(\sum_{i=0}^{t}a_{i}P_{m}^{i}(r^{\theta}), \dots, \sum_{i=0}^{t}a_{i}P_{m}^{i}(r^{\theta})\right), \] where \(t=\lfloor\frac{n}{h}\rfloor\) and \(\theta=\frac{h}{k}\). The results are then used to determine the permanent and eigenvalues of the \(r\)-circulant matrix. The second set of results is related to the sparse \(r\)-circulant matrices, \(A=a_{0}I+a_{i}P_{n}^{i}(r)+a_{j}P^{j}_{n}(r)\), where \(i,j\) and \(n\) are positive integers and \(1\leq i< j\leq n\). The author gives a characterization of this type of circulant matrices under different assumptions and determines a lower bound of the permanent.
Mathematics Subject Classification ID: 15A15
Mathematics Subject Classification ID: 15A18
Mathematics Subject Classification ID: 15B05
Mathematics Subject Classification ID: 15A45
zbMATH DE Number: 6418185
zbMATH Keywords: \(h\)-circulant matrices
zbMATH Keywords: \(r\)-circulant matrices
zbMATH Keywords: \((h,r)\)-generalized circulant matrices
zbMATH Keywords: permanent
zbMATH Keywords: direct sums
zbMATH Keywords: eigenvalue
reviewed by: Tin-Yau Tam
MaRDI profile type: Publication
full work available at URL: s11075-014-9855-7
OpenAlex ID: W2050804654
cites work: Q3838155
cites work: Computing the square roots of a class of circulant matrices
cites work: Q4815662
cites work: On very sparse circulant \((0,1)\) matrices
cites work: The complexity of computing the permanent
cites work: An Algorithm for the Permanent of Circulant Matrices
cites work: On the parity of permanents of circulant matrices
cites work: Computation of sparse circulant permanents via determinants
cites work: Calculation of the permanent of a sparse positive matrix
cites work: On the permanent of certain \((0,1)\) Toeplitz matrices
cites work: Efficiently computing the permanent and Hafnian of some banded Toeplitz matrices
cites work: On the permanent of random Bernoulli matrices
DOI: 10.1007/S11075-014-9855-7
description: scientific article; zbMATH DE number 6418185