Related papers: Characterization of half-radial matrices
An $r$-matrix is a matrix with symbols in $\{0,1,\ldots,r-1\}$. A matrix is simple if it has no repeated columns. Let ${\cal F}$ be a finite set of $r$-matrices. Let $\hbox{forb}(m,r,{\cal F})$ denote the maximum number of columns possible…
We prove sharp lower bounds for the smallest singular value of a partial Fourier matrix with arbitrary "off the grid" nodes (equivalently, a rectangular Vandermonde matrix with the nodes on the unit circle), in the case when some of the…
We develop various lower bounds for the numerical radius $w(A)$ of a bounded linear operator $A$ defined on a complex Hilbert space, which improve the existing inequality $w^2(A)\geq \frac{1}{4}\|A^*A+AA^*\|$. In particular, for $r\geq 1$,…
In numerical analysis it is often necessary to estimate the condition number $CN(T)=||T||_{} \cdot||T^{-1}||_{}$ and the norm of the resolvent $||(\zeta-T)^{-1}||_{}$ of a given $n\times n$ matrix $T$. We derive new spectral estimates for…
Let $A$ be a bounded linear operator defined on a complex Hilbert space and let $|A|=(A^*A)^{1/2}$ be the positive square root of $A$. Among other refinements of the well known numerical radius inequality $w^2(A)\leq \frac12 \|A^*A+AA^*\|$,…
Given matrices $A$ and $B$ such that $B=f(A)$, where $f(z)$ is a holomorphic function, we analyze the relation between the singular values of the off-diagonal submatrices of $A$ and $B$. We provide family of bounds which depend on the…
An n-simplex is called circumscriptible (or edge-incentric) if there is a sphere tangent to all its n(n + 1)/2 edges. We obtain a closed formula for the radius of the circumscribed sphere of the circumscriptible n-simplex, and also prove a…
Given a real matrix A with n columns, the problem is to approximate the Gram product AA^T by c << n weighted outer products of columns of A. Necessary and sufficient conditions for the exact computation of AA^T (in exact arithmetic) from c…
A trivially zero minor of a matrix is a minor having all its terms in the Leibniz formula equal to zero. A matrix is superregular if all of its minors that are not trivially zero are nonzero. In the area of Coding Theory, superregular…
We investigate the stabilizability of linear discrete-time switched systems with singular matrices, focusing on the spectral radius in this context. A new lower bound of the stabilizability radius is proposed, which is applicable to any…
The border rank of the matrix multiplication operator for n by n matrices is a standard measure of its complexity. Using techniques from algebraic geometry and representation theory, we show the border rank is at least 2n^2-n. Our bounds…
This article focuses on several significant bounds of $q$-numerical radius $w_q(A)$ for sectorial matrix $A$ which refine and generalize previously established bounds. One of the significant bounds we have derived is as follows:…
The low-rank matrix completion problem asks whether a given real matrix with missing values can be completed so that the resulting matrix has low rank or is close to a low-rank matrix. The completed matrix is often required to satisfy…
A graph is almost self-centered (ASC) if all but two of its vertices are central. An almost self-centered graph with radius $r$ is called an $r$-ASC graph. The $r$-ASC index $\theta_r(G)$ of a graph $G$ is the minimum number of vertices…
The boundary of a numerical range of a finite matrix is always a nice curve (algebraic, closed and simple), but the equation it satisfies is often very complicated. We will show that, furthermore, there is no hope of describing these curves…
Matrices are typically considered over fields or rings. Motivated by applications in parametric differential equations and data-driven modeling, we suggest to study matrices with entries from a Hilbert space and present an elementary theory…
Let $\mathcal{H}$ be a complex Hilbert space and let $A$ be a positive operator on $\mathcal{H}$. We obtain new bounds for the $A$-numerical radius of operators in semi-Hilbertian space $\mathcal{B}_A(\mathcal{H})$ that generalize and…
Let $\mu_1$ be a complex number in the numerical range $W(A)$ of a normal matrix $A$. In the case when no eigenvalues of $A$ lie in the interior of $W(A)$, we identify the smallest convex region containing all possible complex numbers…
For an $N \times N$ matrix $A$, its rank-$r$ rigidity, denoted $\mathcal{R}_A(r)$, is the minimum number of entries of $A$ that one must change to make its rank become at most $r$. Determining the rigidity of interesting explicit families…
The numerical radius of the general $2\times2$ complex matrix is calculated.