On inverting circulant matrices

The elements of the inverse of a circulant matrix having only three non-zero elements in each row (located in cyclically adjacent columns) are derived analytically from the solution of a recurrence equation. Expressing any circulant as a product containing these three-element-type circulants then provides an algorithm for inverting circulants in general. Extension is also made to deriving generalized inverses of certain singular circulants.     

Linear circulant matricesover a finite field

Rings of polynomials R_N = Z_p[x]/x^N − 1 which are isomorphic to Z_P^N are studied, where p is prime and N is an integer. If I is an ideal in R_N, the code K whose vectors constitute the isomorphic image of I is a linear cyclic code. If I is a principle ideal and K contains only the trivial cycle 0 and one nontrivial cycle of maximal least period N, then the code words of K/ 0 obtained by removing the zero vector can be arranged in an order which constitutes a linear circulant matrix, C. The distribution of the elements of C is such that it forms the cyclic core of a generalized Hadamard matrix over the additive group of Z_Pp. A necessary condition that C = K/ 0 be linear circulant is that for each row vector v of C, the periodic infinite sequence a(v) produced by cycling the elements of v be period invariant under an arbitrary permutation of the elements of the first period. The necessary and sufficient condition that C be linear circulant is that the dual ideal generated by the parity check polynomial h(χ) of K be maximal (a nontrivial, prime ideal of R_N), with N = p^k − 1 and k = deg (h(χ)).     

Fast Structured Matrix Computations: Tensor Rank and Cohn–Umans Method

We discuss a generalization of the Cohn–Umans method, a potent technique developed for studying the bilinear complexity of matrix multiplication by embedding matrices into an appropriate group algebra. We investigate how the Cohn–Umans method may be used for bilinear operations other than matrix multiplication, with algebras other than group algebras, and we relate it to Strassen’s tensor rank approach, the traditional framework for investigating bilinear complexity. To demonstrate the utility of the generalized method, we apply it to find the fastest algorithms for forming structured matrix–vector product, the basic operation underlying iterative algorithms for structured matrices. The structures we study include Toeplitz, Hankel, circulant, symmetric, skew-symmetric, f-circulant, block Toeplitz–Toeplitz block, triangular Toeplitz matrices, Toeplitz-plus-Hankel, sparse/banded/triangular. Except for the case of skew-symmetric matrices, for which we have only upper bounds, the algorithms derived using the generalized Cohn–Umans method in all other instances are the fastest possible in the sense of having minimum bilinear complexity. We also apply this framework to a few other bilinear operations including matrix–matrix, commutator, simultaneous matrix products, and briefly discuss the relation between tensor nuclear norm and numerical stability.     

对角因子分块循环矩阵的对角化和谱分解

导出了对角因子分块循环矩阵的概念，把循环矩阵的对角化和谱分解推广到具有对角因子循环结构的分块矩阵中去．     

求置换因子循环矩阵的逆阵及广义逆阵的快速算法

1 引 言 循环矩阵由于其应用非常广泛而成为一类重要的特殊矩阵,如在图象处理、编码理论、自回归滤波器设计等领域中经常会遇到以这类矩阵为系数的线性系统的求解问题.而对称循环组合系统也具有广泛的实际背景,例如造纸机的横向控制系统,具有平行结     

首尾差分块循环矩阵的性质及非奇异性

本文提出了首尾差分块循环矩阵的概念,包括(n,m)型首尾差分块循环矩阵和(n,m)型二重首尾差分块循环矩阵,讨论了它们的性质,并给出了判定其非奇异性的充要条件.     

基于对数极坐标及对称循环矩阵的形状特征描述

在形状检索算法中,满足尺度和旋转不变是基本要求.本文将形状的边界用对数极坐标表示,使得形状的放缩和旋转化为简单的平移.由于计算机读取形状边界信息时与起点有关,当形状旋转时会带来边界点列的循环,影响旋转不变性.为消除边界点列循环带来的影响,本文首先证明"奇数阶对称循环矩阵,当生成元循环时,所得循环矩阵的特征值不变",在这个数学理论基础上,把形状边界点数插值到奇数,构造相应的对称循环矩阵,通过这个循环矩阵的特征值来描述形状特征,由此得到一种具有放缩旋转不变的形状检索新算法.实验表明,本文算法对运动目标和非刚性形变的形状检索具有良好的鲁棒性和快捷的运行速度,这在目标跟踪方面将发挥作用.     

Zero forcing sets and bipartite circulants

In this paper we introduce a class of regular bipartite graphs whose biadjacency matrices are circulant matrices – a generalization of circulant graphs which happen to be bipartite – and we describe some of their properties. Notably, we compute upper and lower bounds for the zero forcing number for such a graph based only on the parameters that describe its biadjacency matrix. The main results of the paper characterize the bipartite circulant graphs that achieve equality in the lower bound and compute their minimum ranks.     

循环矩阵及其在结构计算中的应用

本文推广了循环矩阵的概念,讨论了它的一般性质,并提出了一种解系数矩阵为循环矩阵或准循环矩阵的线性代数方程组(这种方程组在一大类常见的结构物的计算中出现)的方法,这种解法比通常解法计算量小而且节省存储,同时还允许应用快速富氏变换以增怏其计算速度。     

Recursive Determination of the Generalized Moore–Penrose <Emphasis Type="Italic">M</Emphasis>-Inverse of a Matrix

In this paper, we obtain recursive relations for the determination of the generalized Moore–Penrose M-inverse of a matrix. We develop separate relations for situations when a rectangular matrix is augmented by a row vector and when such a matrix is augmented by a column vector.     

Estimations on upper and lower bounds of solutions to a class of tensor complementarity problems

We introduce a class of structured tensors, called generalized row strictly diagonally dominant tensors, and discuss some relationships between it and several classes of structured tensors, including nonnegative tensors, Btensors, and strictly copositive tensors. In particular, we give estimations on upper and lower bounds of solutions to the tensor complementarity problem (TCP) when the involved tensor is a generalized row strictly diagonally dominant tensor with all positive diagonal entries. The main advantage of the results obtained in this paper is that both bounds we obtained depend only on the tensor and constant vector involved in the TCP;and hence, they are very easy to calculate.     

循环图的距离能量（英文）

For a connected graph G, the distance energy of G is a recently developed energytype invariant, defined as the sum of absolute values of the eigenvalues of the distance matrix G. A graph is called circulant if it is Cayley graph on the circulant group, i.e., its adjacency matrix is circulant. In this note, we establish lower bounds for the distance energy of circulant graphs. In particular, we discuss upper bound of distance energy for the 4-circulant graph.     

Quasi‐Toeplitz splitting iteration methods for unsteady space‐fractional diffusion equations

We construct a class of quasi‐Toeplitz splitting iteration methods to solve the two‐sided unsteady space‐fractional diffusion equations with variable coefficients. By making full use of the structural characteristics of the coefficient matrix, the method only requires computational costs of O(n log n) with n denoting the number of degrees of freedom. We develop an appropriate circulant matrix to replace the Toeplitz matrix as a preconditioner. We discuss the spectral properties of the quasi‐circulant splitting preconditioned matrix. Numerical comparisons with existing approaches show that the present method is both effective and efficient when being used as matrix splitting preconditioners for Krylov subspace iteration methods.     

Spectral Norm of Circulant-Type Matrices

We first discuss the convergence in probability and in distribution of the spectral norm of scaled Toeplitz, circulant, reverse circulant, symmetric circulant, and a class of k-circulant matrices when the input sequence is independent and identically distributed with finite moments of suitable order and the dimension of the matrix tends to ∞.     

A Note on the Superoptimal Matrix Algebra Operators

We study the superoptimal Frobenius operators in several matrix vector spaces and in particular in the circulant algebra, by emphasizing both the algebraic and geometric properties. More specifically we prove a series of "negative" results that explain why this approximation procedure is not competitive with the optimal Frobenius approximation, although it could be used for regularization purposes.     

Generalized inverses of circulant and generalized circulant matrices

An expression for the Moore-Penrose inverse of certain singular circulants by S.R. Searle is generalized to include all circulants. Similar expressions are given for the Moore-Penrose inverse of block circulants with circulant blocks, level-q circulants, k-circulants where |k|=1, and certain other matrices which are the product of a permutation matrix and a circulant. Expressions for other generalized inverses are given.     

MATRIX ALGORITHMS AND ERROR FORMULA FOR BIVARIATE THIELE-TYPE RECTANGULAR MATRIX VALUED RATIONAL INTERPOLATION

A new method for the construction of bivariate matrix valued rational interpolants (BGIRI) on a rectangular grid is presented in [6]. The rational interpolants are of Thiele-type continued fraction form with scalar denominator. The generalized inverse introduced by [3]is gen-eralized to rectangular matrix case in this paper. An exact error formula for interpolation is ob-tained, which is an extension in matrix form of bivariate scalar and vector valued rational interpola-tion discussed by Siemaszko[l2] and by Gu Chuangqing [7] respectively. By defining row and col-umn-transformation in the sense of the partial inverted differences for matrices, two type matrix algorithms are established to construct corresponding two different BGIRI, which hold for the vec-tor case and the scalar case.     

一个被遗漏的Hermite标准形的重要性质及应用

为了使Hermite标准形得到更好的应用,给出了左、右单位矩阵的概念,并指出了矩阵的Hermite行(列)标准形与该矩阵的右(左)单位矩阵的关系,且将其灵活地运用到矩阵广义逆及矩阵方程的讨论中去.     

一类Toeplitz线性代数方程组的预处理GMRES方法

本文研究一类来源于分数阶特征值问题的Toeplitz线性代数方程组的求解.构造Strang循环矩阵作为预处理矩阵来求解该Toeplitz线性代数方程组,分析了预处理后系数矩阵的特征值性质.提出求解该线性代数方程组的预处理广义极小残量法（PGMRES）,并给出该算法的计算量.数值算例表明了该方法的有效性.