نتایج جستجو برای: joint matrix higher rank numerical range
تعداد نتایج: 2350093 فیلتر نتایج به سال:
In this paper, we address the problem of joint direction-of-arrival (DoA) and range estimation using frequency diverse coprime array (FDCA). By incorporating structure offsets, a two-dimensional space-frequency virtual difference coarray corresponding to uniform offset is considered increase number degrees-of-freedom (DoFs). However, reconstruction doubly-Toeplitz covariance matrix computationa...
In this paper, a numerical method for nding minimal solution of a mn fullyfuzzy linear system of the form Ax = b based on pseudo inverse calculation,is given when the central matrix of coecients is row full rank or column fullrank, and where A~ is a non-negative fuzzy mn matrix, the unknown vectorx is a vector consisting of n non-negative fuzzy numbers and the constant b isa vector consisting o...
We consider linearly independent families of Hermitian matrices {A1, . . . , Am} so thatWk(A) is convex. It is shown that m can reach the upper bound 2k(n− k) + 1. A key idea in our study is relating the convexity of Wk(A) to the problem of constructing rank k orthogonal projections under linear constraints determined by A. The techniques are extended to study the convexity of other generalized...
let x be an n-square complex matrix with the cartesian decomposition x = a + i b, where a and b are n times n hermitian matrices. it is known that $vert x vert_p^2 leq 2(vert a vert_p^2 + vert b vert_p^2)$, where $p geq 2$ and $vert . vert_p$ is the schatten p-norm. in this paper, this inequality and some of its improvements ...
We present the full-rank representations of {2, 4} and {2, 3}-inverses (with given rank as well as with prescribed range and null space) as particular cases of the full-rank representation of outer inverses. As a consequence, two applications of the successive matrix squaring (SMS) algorithm from [P.S. Stanimirović, D.S. Cvetković-Ilić, Successive matrix squaring algorithm for computing outer i...
Using an matrix as the mathematical framework, we compactly represent a dense system matrix by a reduced set of parameters, thus enabling a significant reduction in computational complexity. The error bound of the -matrix-based representation of an electrodynamic problem was derived. We show that exponential convergence with respect to the number of interpolation points can be achieved irrespec...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید