Results 31 to 40 of about 2,339 (216)
Convolutional compressed sensing using deterministic sequences [PDF]
This is the author's accepted manuscript (with working title "Semi-universal convolutional compressed sensing using (nearly) perfect sequences"). The final published article is available from the link below. Copyright @ 2012 IEEE.
Cong Ling +4 more
core +1 more source
Approximating Inverse of Toeplitz Matrices by Circulant Matrices [PDF]
To a continuous complex-valued function \(A\) on the complex unit circle, one can associate a sequence \(\{T_n(a)\}_{n=1}^\infty\) of Toeplitz matrices and a sequence \(\{C_n(a)\}_{n=1}^\infty\) of circulant matrices. In the paper under review, the authors consider the problem of estimating the difference \(T_n^{-1}(a)-C_n^{-1}(a)\) in some sense. They
Bottcher, A. +2 more
openaire +2 more sources
Circulant Type Matrices with the Sum and Product of Fibonacci and Lucas Numbers
Circulant type matrices have become an important tool in solving differential equations. In this paper, we consider circulant type matrices, including the circulant and left circulant and g-circulant matrices with the sum and product of Fibonacci and ...
Zhaolin Jiang, Yanpeng Gong, Yun Gao
doaj +1 more source
Determinants of some special matrices over commutative finite chain rings
Circulant matrices over finite fields and over commutative finite chain rings have been of interest due to their nice algebraic structures and wide applications. In many cases, such matrices over rings have a closed connection with diagonal matrices over
Jitman Somphong
doaj +1 more source
On the Norms of RFMLR-Circulant Matrices with the Exponential and Trigonometric Functions
In this paper, based on combinatorial methods and the structure of RFMLR-circulant matrices, we study the spectral norms of RFMLR-circulant matrices involving exponential forms and trigonometric functions.
Baijuan Shi
doaj +1 more source
On circulant thin Lehman matrices [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tadashi Sakuma, Hidehiro Shinohara
openaire +2 more sources
Fourier and Circulant Matrices are Not Rigid
The concept of matrix rigidity was first introduced by Valiant in 1977. Roughly speaking, a matrix is rigid if its rank cannot be reduced significantly by changing a small number of entries. There has been extensive interest in rigid matrices as Valiant showed in his MFCS'77 paper that rigidity can be used to prove arithmetic circuit lower bounds. In a
Dvir, Zeev, Liu, Allen
openaire +6 more sources
We consider the skew circulant and skew left circulant matrices with any continuous Lucas numbers. Firstly, we discuss the invertibility of the skew circulant matrices and present the determinant and the inverse matrices by constructing the ...
Jin-jiang Yao, Zhao-lin Jiang
doaj +1 more source
An Algorithm for the Permanent of Circulant Matrices [PDF]
The permanent of an n ✕ n matrix A = (aij) is the matrix function1where the summation is over all permutations in the symmetric group, Sn. An n ✕ n matrix A is a circulant if there are scalars a1 …, an such that2where P is the n ✕ n permutation matrix corresponding to the cycle (12 … n) in Sn.
Cummings, Larry J, Seberry, Jennifer
openaire +2 more sources
Exact Determinants of Some Special Circulant Matrices Involving Four Kinds of Famous Numbers
Circulant matrix family is used for modeling many problems arising in solving various differential equations. The RSFPLR circulant matrices and RSLPFL circulant matrices are two special circulant matrices.
Xiaoyu Jiang, Kicheon Hong
doaj +1 more source

