非负循环矩阵的不可约性判定

利用关联矩阵,本文给出了关于非负循环矩阵不可约性及本原性的若干结果。     

循环矩阵本原指数的上界估计

本文给出了循环矩阵本原指数上界的新的估计及一种由级数较低的循环矩阵的本原指数估计级数较高的循环矩阵的本原指数的方法，解决了一类循环矩阵本原指数的计算问题．     

循环逆M-矩阵的判定

给出了循环逆M-矩阵的判定方法:如果一个n×n非负循环矩阵非正且不等于c0I,若存在一个正整数K是n的真因子,使得cjk>0,j=0,1[,…,n-k]k,其余的ci等于0且Circ[c0,ck,…,cn-k]是一个逆M-矩阵,则A是一个逆M-矩阵.     

循环逆M-矩阵的判定

给出了循环逆M-矩阵的判定方法:如果一个n×n非负循环矩阵非正且不等于c0I,若存在一个正整数K是n的真因子,使得cjk0,j=0,1[,…,n-k]k,其余的ci等于0且Circ[c0,ck,…,cn-k]是一个逆M-矩阵,则A是一个逆M-矩阵.     

幂等矩阵线性组合的可逆性

设T1,T2,T3是三个不同的两两相互可交换的n×n非零的三次幂等矩阵,并且c1,c2,c3是非零数.本文主要给出了线性组合c1T1 c2T2 c3T3可逆性的刻画.     

关于布尔矩阵半群和非负矩阵半群的几点注记

本文重点讨论了布尔矩阵半群中的幂等、广义幂等、素矩阵以及它们之间的联系，对非负矩阵半群上的类零型结构也进行了研究．     

Vandermonde矩阵的一种应用

以Vandermonde矩阵的基本性质、矩阵的特征值与迹之间的关系为理论依据，由矩阵的（理论）特征值生成的Vandermonde矩阵．构造出一种特殊的等幂和矩阵．即幂迹矩阵，在此基础上可给出判定任意n阶实矩阵的互异特征值个数的三个充要条件．以及相应的算法和自定义matlab函数．     

三幂等矩阵的一些性质

重点探索了三幂等矩阵的性质.主要从矩阵乘积、线性变换和矩阵的秩等角度出发,将幂等矩阵的性质向三幂等矩阵推广,对三幂等矩阵的性质进行探究,得到了15个相关结论,并给出部分性质的详细推导过程.     

$k$-次幂等矩阵线性组合群逆和超广义幂等矩阵线性组合Moore-Penrose广义逆的表

在 $T_{1}T_{2}T_{1}=T_{2}$, $T_{2}T_{1}^{k-1}=T_{1}T_{2}^{k-1}$ 和 $T_{1}T_{2}T_{1}=T_{2}T_{1}$的条件下, 得到k-次幂等矩阵线性组合群逆的表示. 另外, 在$T_{1}T_{2}T_{1}=T_{2}$ 和 $T_{1}^{2}T_{2}=T_{2}$ 的条件下, 计算超广义幂等矩阵线性组合Moore-Penrose 广义逆的表示     

一类特殊分块矩阵为循环矩阵的循环分块矩阵的几个性质

本文给出一类特殊分块矩阵为循环矩阵的循环分块矩阵的几个性质。     

Approximation of high-dimensional kernel matrices by multilevel circulant matrices

Kernels are important in developing a variety of numerical methods, such as approximation, interpolation, neural networks, machine learning and meshless methods for solving engineering problems. A common problem of these kernel-based methods is to calculate inverses of kernel matrices generated by a kernel function and a set of points. Due to the denseness of these matrices, finding their inverses is computationally costly. To overcome this difficulty, we introduce in this paper an approximation of the kernel matrices by appropriate multilevel circulant matrices so that the fast Fourier transform can be applied to reduce the computational cost. Convergence analysis for the proposed approximation is established based on certain decay properties of the kernels.     

Inversion of circulant matrices over

In this paper we consider the problem of inverting an circulant matrix with entries over . We show that the algorithm for inverting circulants, based on the reduction to diagonal form by means of FFT, has some drawbacks when working over . We present three different algorithms which do not use this approach. Our algorithms require different degrees of knowledge of and , and their costs range, roughly, from to operations over . Moreover, for each algorithm we give the cost in terms of bit operations. We also present an algorithm for the inversion of finitely generated bi-infinite Toeplitz matrices. The problems considered in this paper have applications to the theory of linear cellular automata.

     

Finiteness of circulant weighing matrices of fixed weight

Let n be a fixed positive integer. Every circulant weighing matrix of weight n arises from what we call an irreducible orthogonal family of weight n. We show that the number of irreducible orthogonal families of weight n is finite and thus obtain a finite algorithm for classifying all circulant weighing matrices of weight n. We also show that, for every odd prime power q, there are at most finitely many proper circulant weighing matrices of weight q.     

Fast computation of two-level circulant preconditioners

In this paper we present an algorithm for the construction of the superoptimal circulant preconditioner for a two-level Toeplitz linear system. The algorithm is fast, in the sense that it operates in FFT time. Numerical results are given to assess its performance when applied to the solution of two-level Toeplitz systems by the conjugate gradient method, compared with the Strang and optimal circulant preconditioners.     

Double circulant matrices

Double circulant matrices are introduced and studied. By a matrix-theoretic method, the rank r of a double circulant matrix is computed, and it is shown that any consecutive r rows of the double circulant matrix are linearly independent. As a generalization, multiple circulant matrices are also introduced. Two questions on square double circulant matrices are posed.     

A comparison of lower bounds for the symmetric circulant traveling salesman problem

When the matrix of distances between cities is symmetric and circulant, the traveling salesman problem (TSP) reduces to the so-called symmetric circulant traveling salesman problem (SCTSP), that has applications in the design of reconfigurable networks, and in minimizing wallpaper waste. The complexity of the SCTSP is open, but conjectured to be NP-hard, and we compare different lower bounds on the optimal value that may be computed in polynomial time. We derive a new linear programming (LP) relaxation of the SCTSP from the semidefinite programming (SDP) relaxation in [E. de Klerk, D.V. Pasechnik, R. Sotirov, On semidefinite programming relaxation of the traveling salesman problem, SIAM Journal of Optimization 19 (4) (2008) 1559-1573]. Further, we discuss theoretical and empirical comparisons between this new bound and three well-known bounds from the literature, namely the Held-Karp bound [M. Held, R.M. Karp, The traveling salesman problem and minimum spanning trees, Operations Research 18 (1970) 1138-1162], the 1-tree bound, and the closed-form bound for SCTSP proposed in [J.A.A. van der Veen, Solvable cases of TSP with various objective functions, Ph.D. Thesis, Groningen University, The Netherlands, 1992].     

The inverse of circulant matrix

A direct method is proposed to get the inverse matrix of circulant matrix that find important application in engineering, the elements of the inverse matrix are functions of zero points of the characteristic polynomial g(z) and g′(z) of circulant matrix, four examples to get the inverse matrix are presented in the paper.