The main goal of this article is to establish several new \({\mathbb {A}}\)-numerical radius equalities for \(n\times n\) circulant, skew imaginary tridiagonal, and anti-tridiagonal operator matrices, where {A}}\) the diagonal matrix whose entries are positive bounded A. Some special cases our results lead earlier works in literature, which shows that more general. Further, some pinching type i...

In this paper, we consider a g-circulant matrixA 1(T), whose the first row entries are generalized Tribonacci numbers T(a)i. We give an explicit formula of spectral norm matrix. When g = 1, also present upper and lower bounds for spread 1-circulant matrix A1(T).

Circulant matrices are an important family of operators, which have a wide range of applications in science and engineering-related fields. They are, in general, non-sparse and non-unitary. In this paper, we present efficient quantum circuits to implement circulant operators using fewer resources and with lower complexity than existing methods. Moreover, our quantum circuits can be readily exte...

fifty years ago warren and root have introduced the shape factor. this fundamental parameter for modeling of naturally fractured reservoirs has been discussed stormily ever since. different definitions for shape factor have been suggested which all of them are heuristically based. recently, heinemann and mittermeir mathematically derived - based on the dual-continuum theorem assuming pseudo-ste...

We propose a simple inter-symbol interference (ISI) and inter-block interference (IBI) cancellation scheme for single carrier block transmission with cyclic prefix (SCCP) systems with insufficient guard interval (GI). In the SC-CP system, the equalization and demodulation processing is conducted in a block-by-block manner, therefore, the IBI can be reduced by using previously detected data sign...

In this paper, we propose a method to generalize Strang's circulant preconditioner for arbitrary n-by-n matrices An. The n 2 th column of our circulant preconditioner Sn is equal to the n 2 th column of the given matrix An. Thus if An is a square Toeplitz matrix, then Sn is just the Strang circulant preconditioner. When Sn is not Hermitian, our circulant preconditioner can be deened as (S n Sn)...

Calculating the permanent of a (0, 1) matrix is a #P -complete problem but there are some classes of structuredmatrices for which the permanent is calculable in polynomial time. The most well-known example is the fixedjump (0, 1) circulant matrix which, using algebraic techniques, was shown by Minc to satisfy a constant-coefficient fixed-order recurrence relation. In this note we show how, by i...

We consider circulant preconditioners for Hermitian Toeplitz systems from the view point of function theory. We show that some well-known circulant preconditioners can be derived from convoluting the generating function f of the Toeplitz matrix with famous kernels like the Dirichlet and the Fej er kernels. Several circulant precondition-ers are then constructed using this approach. Finally, we ...

The modularity of a modular multilevel dc converter (MMDC) makes it attractive for medium voltage distribution systems. Inherent balance submodule (SM) capacitor voltages is considered as an ideal property which avoids complex sorting process based on many measurements thereby reducing costs and enhancing reliability. This paper extends the inherent concept previously shown square-wave modulati...

A k x k matrix A = [aU lover a field F is called circulant if aij = a (j-i) mod k' A [2k ,k l linear code over F = GF (q) is called double-circulant if it is generated by a matrix of the fonn [I A l, where A is a circulant matrix. In this work we ftrst employ the Fourier transform techJ nique to analyze and construct se:veral families of double-circulant codes. The minimum distance of the resul...