نتایج جستجو برای: circulant matrix
تعداد نتایج: 365418 فیلتر نتایج به سال:
Partially due to the fact that the empirical data collected by devices with finite bandwidth often neither preserves the specified structure nor induces a certain desired rank, retrieving the nearest structured low rank approximation from a given data matrix becomes an imperative task in many applications. This paper investigates the case of approximating a given target matrix by a real-valued ...
This paper presents results on the memory capacity of a generalized feedback neural network using a circulant matrix. Children are capable of learning soon after birth which indicates that the neural networks of the brain have prior learnt capacity that is a consequence of the regular structures in the brain’s organization. Motivated by this idea, we consider the capacity of circulant matrices ...
Consider the powers of a square matrix A of order n in bottleneck algebra, where addition and multiplication are replaced by the max and min operations. The powers are periodic, starting from a certain power AK . The smallest such K is called the exponent of A and the length of the period is called the index of A. Cechlárová has characterized the matrices of index 1. Here we consider the case w...
In this paper , the concept of the partition anti-circulant matrix on skew field is given,and its operational properties is discussed. Mathematics Subject Classification: 15A24
The numerical solution of large and sparse nonsymmetric linear systems of algebraic equations is usually the most time consuming part of time-step integrators for differential equations based on implicit formulas. Preconditioned Krylov subspace methods using Strang block circulant preconditioners have been employed to solve such linear systems. However, it has been observed that these block cir...
Polynomial based methods have recently been used in several works for mitigating the effect of stragglers (slow or failed nodes) distributed matrix computations. For a system with $n$ worker nodes where notation="LaTeX">$s$ can be stragglers, these approaches allow an optimal recovery threshold, whereby intended result dec...
A class of supersaturated designs called k-circulant designs is explored. These designs are constructed from cyclic generators by cycling k elements at a time. The class of designs includes many Es2-optimal designs, some of which are already known and some of which are more ef cient than known designs for model estimation under factor sparsity. Generators for the most ef cient designs are lis...
A fast solution algorithm is proposed for solving block banded block Toeplitz systems with non-banded Toeplitz blocks. The algorithm constructs the circulant transformation of a given Toeplitz system and then by means of the Sherman-Morrison-Woodbury formula transforms its inverse to an inverse of the original matrix. The block circulant matrix with Toeplitz blocks is converted to a block diago...
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...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید