Related papers: The Correlation Numerical Range of a Matrix and Co…
A presentation of numerical range for rectangular matrices is undertaken in this paper, introducing two different definitions and elaborating basic properties. Then we are extended to the treatment of rank-k numerical range.
The numerical range of a matrix is studied geometrically via the cone of positive semidefinite matrices (or semidefinite cone for short). In particular it is shown that the feasible set of a two-dimensional linear matrix inequality (LMI),…
The numerical range of a matrix is studied geometrically via the cone of positive semidefinite matrices (or semidefinite cone for short). In particular it is shown that the feasible set of a two-dimensional linear matrix inequality (LMI),…
Matrix Completion is the problem of recovering an unknown real-valued low-rank matrix from a subsample of its entries. Important recent results show that the problem can be solved efficiently under the assumption that the unknown matrix is…
Let $L$ be a degree $2$ Galois extension of the field $K$ and $M$ an $n\times n$ matrix with coefficients in $L$. Let $\langle \ ,\ \rangle : L^n\times L^n\to L$ be the sesquilinear form associated to the involution $\sigma: L\to L$ fixing…
In this paper, we compute the spectral norms of the matrices related with integer squences and we give some example related with Fibonacci, Lucas, Pell and Perrin numbers.
The process of alternately row scaling and column scaling a positive $n \times n$ matrix $A$ converges to a doubly stochastic positive $n \times n$ matrix $S(A)$, called the \emph{Sinkhorn limit} of $A$. Exact formulae for the Sinkhorn…
In this article, we are going to introduce the weighted numerical range which is a further generalization both the c-numerical range and the rank k numerical range. If the boundaries of weighted numerical ranges of two matrices (possibly of…
In this paper we discuss the relationship between the numerical range of an extensive class of unbounded operator functions and the joint numerical range of the operator coefficients. Furthermore, we derive methods on how to find estimates…
We study the relation between the intrinsic and the spatial numerical ranges with the recently introduced "approximated" spatial numerical range. As main result, we show that the intrinsic numerical range always coincides with the convex…
We introduce a novel parametrization of the correlation matrix. The reparametrization facilitates modeling of correlation and covariance matrices by an unrestricted vector, where positive definiteness is an innate property. This…
Motivated by the remarkable interplay between (chordal) graphs and matrix algebra, we associate to each graph a so-called completion number that might encode some aspects of that interplay. We show that this number is not trivial, and we…
A short proof of the elliptical range theorem concerning the numerical range of $2\times2$ complex matrices is given.
We obtain sequences of inclusion sets for the spectrum, essential spectrum, and pseudospectrum of banded, in general non-normal, matrices of finite or infinite size. Each inclusion set is the union of the pseudospectra of certain…
We analyze the spectral properties of large, time-lagged correlation matrices using the tools of random matrix theory. We compare predictions of the one-dimensional spectra, based on approaches already proposed in the literature. Employing…
The notion of the higher rank numerical range $\Lambda_{k}(L(\lambda))$ for matrix polynomials $L(\lambda)=A_{m}\lambda^{m}+...+A_{1}\lambda+A_{0}$ is introduced here and some fundamental geometrical properties are investigated. Further,…
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…
Random matrices are used in fields as different as the study of multi-orthogonal polynomials or the enumeration of discrete surfaces. Both of them are based on the study of a matrix integral. However, this term can be confusing since the…
Kippenhahn discovered that the numerical range of a complex square matrix is the convex hull of a plane real algebraic curve. Here, we present an example of a convex set, which has a similar algebraic description as the numerical range,…
The number of non-negative integer matrices with given row and column sums appears in a variety of problems in mathematics and statistics but no closed-form expression for it is known, so we rely on approximations of various kinds. Here we…