Owing to its orthogonality, simplicity of the inversion and fast algorithms, Jacket transform generalising from the Hadamard transform has played important roles in signal and image processing, mobile communication for coding design, cryptography, etc. In this paper, inspired by the emerging block Jacket transform, a new class of circulant block Jacket matrices (CBJMs) are mathematically define...

The eigenvalue spectrum of a class of nonsymmetric preconditioned matrices arising in time-dependent partial differential equations is analyzed and discussed. The matrices generated by the underlying numerical integrators are small rank perturbations of block Toeplitz matrices; circulant-like preconditioned based on the former are considered. The eigenvalue distribution of the preconditioned ma...

In this paper, we propose a new family of circulant preconditioners for solving ill-conditioned Hermitian Toeplitz systems Ax = b. The eigenval-ues of the preconditioners are given by the convolution products of the generating function f of A with some summation kernels. When f is a nonnegative 2-periodic continuous function deened on ?; ] with a zero of order 2p, we show that the circulant pre...

In the context of computed tomography (CT), iterative image reconstruction techniques are gaining attention because high-quality images are becoming computationally feasible. They involve the solution of large systems of equations, whose cost is dominated by the sparse matrix vector product (SpMV). Our work considers the case of the sparse matrices being block circulant, which arises when takin...

This paper studies the asymptotic behavior of eigenvalues of random abelian G-circulant matrices, that is, matrices whose structure is related to a finite abelian group G in a way that naturally generalizes the relationship between circulant matrices and cyclic groups. It is shown that, under mild conditions, when the size of the group G goes to infinity, the spectral measures of such random ma...

1. INTRODUCTION. There is something fascinating about procedures for solving low degree polynomial equations. On one hand, we all know that while general solutions (using radicals) are impossible beyond the fourth degree, they have been found for quadratics, cubics, and quartics. On the other hand, the standard solutions for the the cubic and quartic are complicated, and the methods seem ad hoc...

We consider the solution of «-by-« Toeplitz systems T„x = b by preconditioned conjugate gradient methods. The preconditioner Cn is the T. Chan circulant preconditioner, which is defined to be the circulant matrix that minimizes \\B„ T„\\f over all circulant matrices B„ . For Toeplitz matrices generated by positive In -periodic continuous functions, we have shown earlier that the spectrum of the...

The goal of this paper is two-fold. We first focus on the problem of deciding whether two monomial rotation symmetric (MRS) Boolean functions are affine equivalent via a permutation. Using a correspondence between such functions and circulant matrices, we give a simple necessary and sufficient condition. We connect this problem with the well known Ádám’s conjecture from graph theory. As applica...

Compressed sensing seeks to recover a sparse vector from a small number of linear and non-adaptive measurements. While most work so far focuses on Gaussian or Bernoulli random measurements we investigate the use of partial random circulant and Toeplitz matrices in connection with recovery by `1-minization. In contrast to recent work in this direction we allow the use of an arbitrary subset of r...

The energy of a graph is the sum of the moduli of the eigenvalues of its adjacency matrix. We study the energy of integral circulant graphs, also called gcd graphs, which can be characterized by their vertex count n and a set D of divisors of n in such a way that they have vertex set Zn and edge set {{a, b} : a, b ∈ Zn, gcd(a− b, n) ∈ D}. Using tools from convex optimization, we study the maxim...