نتایج جستجو برای: circulant matrix
تعداد نتایج: 365418 فیلتر نتایج به سال:
In signal acquisition, Toeplitz and circulant matrices are widely used as sensing operators. They correspond to discrete convolutions and are easily or even naturally realized in various applications. For compressive sensing, recent work has used random Toeplitz and circulant sensing matrices and proved their efficiency in theory, by computer simulations, as well as through physical optical exp...
a graph is called textit{circulant} if it is a cayley graph on a cyclic group, i.e. its adjacency matrix is circulant. let $d$ be a set of positive, proper divisors of the integer $n>1$. the integral circulant graph $icg_{n}(d)$ has the vertex set $mathbb{z}_{n}$ and the edge set e$(icg_{n}(d))= {{a,b}; gcd(a-b,n)in d }$. let $n=p_{1}p_{2}cdots p_{k}m$, where $p_{1},p_{2},cdots,p_{k}$ are disti...
In this paper we present a time-polynomial recognition algorithm for circulant graphs of prime order. A circulant graphG of order n is a Cayley graph over the cyclic groupZn: Equivalently, G is circulant i its vertices can be ordered such that the corresponding adjacency matrix becomes a circulant matrix. To each circulant graph we may associate a coherent con guration A and, in particular, a S...
In this paper, we discuss the solutions to a class of Hermitian positive deenite system Ax = b by the preconditioned conjugate gradient method with circulant preconditioner C. In general, the smaller the condition number (C ?1=2 AC ?1=2) is, the faster the convergence of the method will be. The circulant matrix C b that minimizes (C ?1=2 AC ?1=2) is called the best conditioned circulant precond...
1 Abstract In this paper we present a time-polynomial recognition algorithm for circulant graphs of prime order. A circulant graph G of order n is a Cayley graph over the cyclic group Z n : Equivalently, G is circulant ii its vertices can be ordered such that the corresponding adjacency matrix becomes a circulant matrix. To each circulant graph we may associate a coherent connguration A and, in...
Let $P(lambda)$ be an $n$-square complex matrix polynomial, and $1 leq k leq n$ be a positive integer. In this paper, some algebraic and geometrical properties of the $k$-numerical range of $P(lambda)$ are investigated. In particular, the relationship between the $k$-numerical range of $P(lambda)$ and the $k$-numerical range of its companion linearization is stated. Moreover, the $k$-numerical...
This paper considers random (non-Hermitian) circulant matrices, and proves several results analogous to recent theorems on non-Hermitian random matrices with independent entries. In particular, the limiting spectral distribution of a random circulant matrix is shown to be complex normal, and bounds are given for the probability that a circulant sign matrix is singular.
An n × n matrix D = d[i, j] is said to be circulant, if the entries d[i, j] verifying (j − i) = k mod n, for some k, have the same value (for a survey on circulant matrix properties, see Davis (1979)). A directed (respectively, undirected) graph is circulant, if its adjacency matrix is circulant (respectively, symmetric, and circulant). Similarly, a weighted graph is circulant, if its weighted ...
Circulant matrix family occurs in various fields, applied in image processing, communications, signal processing, encoding and preconditioner. Meanwhile, the circulant matrices [1, 2] have been extended in many directions recently. The f(x)-circulant matrix is another natural extension of the research category, please refer to [3, 11]. Recently, some authors researched the circulant type matric...
SUMMARY Strang's proposal to use a circulant preconditioner for linear systems of equations with a Hermitian positive definite Toeplitz matrix has given rise to considerable research on circulant preconditioners. This paper presents an {e iϕ }-circulant Strang-type preconditioner.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید