Related papers: Small eigenvalues of large Hankel matrices:The ind…
We give an overview of known results about Hilbert matrices from the point of view of orthogonal polynomials and compute Hankel determinants of harmonic numbers and related topics.
A sum of a large-dimensional random matrix polynomial and a fixed low-rank matrix polynomial is considered. The main assumption is that the resolvent of the random polynomial converges to some deterministic limit. A formula for the limit of…
Matrices with displacement structure such as Pick, Vandermonde, and Hankel matrices appear in a diverse range of applications. In this paper, we use an extremal problem involving rational functions to derive explicit bounds on the singular…
The solutions of an indeterminate Hamburger moment problem can be parameterised using the Nevanlinna matrix of the problem. The entries of this matrix are entire functions of minimal exponential type, and any growth less than that can…
Some monotone increasing sequences of the lower bounds for the minimum eigenvalue of $M$-matrices are given. It is proved that these sequences are convergent and improve some existing results. Numerical examples show that these sequences…
This paper gives a framework to produce the lower bound of eigenvalues defined in a Hilbert space by the eigenvalues defined in another Hilbert space. The method is based on using the max-min principle for the eigenvalue problems.
Large H-selfadjoint random matrices are considered. The matrix $H$ is assumed to have one negative eigenvalue, hence the matrix in question has precisely one eigenvalue of nonpositive type. It is showed that this eigenvalue converges in…
The condition number for eigenvalue computations is a well--studied quantity. But how small can we expect it to be? Namely, which is a perfectly conditioned matrix w.r.t. eigenvalue computations? In this note we answer this question with…
In this paper we express the eigenvalues of anti-heptadiagonal persymmetric Hankel matrices as the zeros of explicit polynomials giving also a representation of its eigenvectors. We present also an expression depending on localizable…
In this paper, we investigate condition numbers of eigenvalue problems of matrix polynomials with nonsingular leading coefficients, generalizing classical results of matrix perturbation theory. We provide a relation between the condition…
We consider the moment space $\mathcal{M}^{p}_{2n+1}$ of moments up to the order $2n + 1$ of $p_n\times p_n$ real matrix measures defined on the interval $[0,1]$. The asymptotic properties of the Hankel determinant $\{\log\det…
We study the asymptotic behavior of the smallest eigenvalue, $\lambda_{N}$, of the Hankel (or moments) matrix denoted by $\mathcal{H}_{N}=\left(\mu_{m+n}\right)_{0\leq m,n\leq N}$, with respect to the weight $w(x)=x^{\alpha}{\rm…
We find out a method for symbolic estimation of a minimal (maximal) distance between eigenvalues of a Hermitian matrix (or roots of a polynomial with real (maybe degenerated) roots), using Hankel matrices formalism. The range of location of…
We give a minimal list of inequalities characterizing the possible eigenvalues of a set of Hermitian matrices with positive semidefinite sum of bounded rank. This answers a question of A. Barvinok.
We study the class of Hankel matrices for which the $k\times k$-block-matrices are positive semi-definite. We prove that a $k\times k$-block-matrix has non zero determinant if and only if all $k\times k$-block matrices have non zero…
To a sequence (s_n)_{n\ge 0} of real numbers we associate the sequence of Hankel matrices \mathcal H_n=(s_{i+j}),0\le i,j \le n. We prove that if the corresponding sequence of Hankel determinants D_n=\det\mathcal H_n satisfy D_n>0 for n<n_0…
A number $\lambda \in \mathbb C $ is called an {\it eigenvalue} of the matrix polynomial $P(z)$ if there exists a nonzero vector $x \in \mathbb C^n$ such that $P(\lambda)x = 0$. Note that each finite eigenvalue of $P(z)$ is a zero of the…
In this note we present a parameterized class of lower triangular matrices. The components of the eigenvectors grow rapidly and will exceed the representational range of any finite number system. The eigenvalues and the eigenvectors are…
This work concerns the distance in 2-norm from a matrix polynomial to a nearest polynomial with a specified number of its eigenvalues at specified locations in the complex plane. Perturbations are allowed only on the constant coefficient…
We will consider the indefinite truncated multidimensional moment problem. Necessary and sufficient conditions for a given truncated multisequence to have a signed representing measure $\mu$ with ${\rm card}\,{\rm supp}\, \mu$ as small as…