نتایج جستجو برای: basic circulant matrix
تعداد نتایج: 626601 فیلتر نتایج به سال:
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...
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...
Block preconditioner with circulant blocks (BPCB) has been used for solving linear systems with block Toeplitz structure since 1992 [R. Chan, X. Jin, A family of block preconditioners for block systems, SIAM J. Sci. Statist. Comput. (13) (1992) 1218–1235]. In this new paper, we use BPCBs to general linear systems (with no block structure usually). The BPCBs are constructed by partitioning a gen...
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.
This paper analyzes circulant Johnson-Lindenstrauss (JL) embeddings which, as an important class of structured random JL embeddings, are formed by randomizing the column signs of a circulant matrix generated by a random vector. With the help of recent decoupling techniques and matrix-valued Bernstein inequalities, we obtain a new bound k = O(ǫ log(n)) for Gaussian circulant JL embeddings. Moreo...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید