Circulant Matrix
On the norms of an r circulant matrix with the generalized k Horadam numbers
... In this paper, we first give lower and upper bounds for the spectral norms of H. In par- ticular, by taking r = , we obtain lower and upper bounds for the spectral norms of the circulant matrix associated ...
8
Cyclic Convolution Algorithm Formulations Using Polynomial Transform Theory
... This document is organized as follows. First, mathematical foundations needed for the study of algorithms to compute the discrete convolution are summarized. Second, an identification is established between products of ...
9
Circulant Interval Valued Fuzzy Matrices
... Abstract. Circulant matrix is a square matrix whose rows are obtained by cyclically rotating by its first ...on circulant interval valued fuzzy matrices ...on circulant interval valued ...
10
On Binary Embedding using Circulant Matrices
... propose Circulant Binary Embedding (CBE) which generates binary codes by projecting the data with a circulant ...The circulant structure allows us to use Fast Fourier Transform algorithms to speed up ...
30
Some (Hopf) algebraic properties of circulant matrices
... Now we can study lattices in the algebra of complex circulant matrices. This study takes us to some conditions about when a circulant matrix is obtained as integral linear combinations of some ...
17
The spectral norms of geometric circulant matrices with the generalized k Horadam numbers
... This matrix was first proposed by Davis in [1], then one found it has many interesting properties, and it is one of the most important research subject in the field of the compu- tation and pure mathematics (see ...
9
On the norms of circulant and r circulant matrices with the hyperharmonic Fibonacci numbers
... Motivated by the above papers, we compute the spectral norms and Euclidean norm of circulant and r-circulant matrices with the harmonic and hyperharmonic Fibonacci entries. The scheme of this paper is as ...
11
On the bounds for the spectral norms of geometric circulant matrices
... of circulant and r-circulant matrices with the hyper-Fibonacci and hyper-Lucas ...of circulant, r-circulant and some special matrices with the harmonic Fibonacci and hyperharmonic Fibonacci ...
15
On the spectral norms of some circulant matrices with the trigonometric functions
... 1885, circulant matrix was first proposed by Muir, and he did some basic ...of circulant matrices; these efforts have opened the door to study circulant matri- ...A circulant ...
10
Eigenvectors of block circulant and alternating circulant matrices
... For vectors of the form (12) the set (16) of n eigenvector equations of order κ, for the n values of ρ, is equivalent to the single eigenvector equation (13), of order nκ. For each of the n values of ρ, the equation (15) ...
20
On the Norms of r Hankel Matrices Involving Fibonacci and Lucas Numbers
... of circulant matrices with fibonacci and lucas numbers in [1], Türkmen and Gökbaş have made a similar study by using the r-circulant matrix with pell and pell-lucas numbers in [2], Shen and Cen have ...
9
Vol 9, No 3 (2018)
... Keywords: Association Schemes (AS), Pseudo Cyclic Association Scheme (PCAS), Block Circulant Matrix, Generalized.. Orthogonal Combinatorial Matrix(GOCM), Row and column regular GOCM.[r] ...
6
A note on the 2 circulant inequalities for the max cut problem
... The separation problem for a given family of valid linear inequalities is this: given a fractional solution to an LP relaxation of an instance of the max-cut problem, either find an inequality in the family that is ...
12
Reliability Measures in Circulant Network
... [2] R. Beivide, E. Herrada, J.L. Balc azar and A. Arruabarrena, Optimal Distance Networks of Low Degree for Parallel Computers, IEEE Transactions on Computers, vol. 40, no. 10, pp. 1109-1124, 1991. [3] F.T. Boesch and J. ...
5
On -hued Coloring of Some Perfect and Circulant Graphs
... Abstract—A r-hued k-coloring of a graph G is a proper coloring with k colors such that for every vertex v with degree dv in G, the neighbors of v must be colored by at least min{dv, r} d[r] ...
6
Combinatorial Properties of Circulant Networks
... [5] R. Beivide, E. Herrada, J.L. Balc azar and A. Arruabarrena, Optimal Distance Networks of Low Degree for Parallel Computers, IEEE Transactions on Computers, vol. 40, no. 10, pp. 1109-1124, 1991. [6] F.T. Boesch and J. ...
5
Embeddings Between Circulant Networks and Hypertrees
... In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the size of the input to the problem. An algorithm is said to take linear time, or O(n) ...
5
Local Landmarks in Circulant Graph
... Abstract — Let G(V, E) be a graph with vertex set V and edge set E. Then a subset of V namely, W is said to be a local metric basis of G, if for any two adjacent vertices u, v belonging to V\W, there exists a vertex w ...
5
Wirelength of Circulant Networks into Wheel Related Graphs
... Abstract. Circulant graphs are an important class of topological structures of interconnection networks which have been used for decades in the design of computer and telecommunication networks due to their ...
7
Vertex Domination Critical in Circulant Graphs
... S.Samanta and M.Pal, Fuzzy k-competition graphs and p-competition fuzzy graphs,. Fuzzy Inf[r] ...
12