Related papers: A matrix realization of spectral bounds

The problem of expressing a specific polynomial as the determinant of a square matrix of affine-linear forms arises from algebraic geometry, optimisation, complexity theory, and scientific computing. Motivated by recent developments in this…

If $G$ is a graph and $\mathbf{m}$ is an ordered multiplicity list which is realizable by at least one symmetric matrix with graph $G$, what can we say about the eigenvalues of all such realizing matrices for $\mathbf{m}$? It has sometimes…

We compute the limiting eigenvalue statistics at the edge of the spectrum of large Hermitian random matrices perturbed by the addition of small rank deterministic matrices. To be more precise, we consider random Hermitian matrices with…

We consider a continuous analogue of Babai et al.'s and Cai et al.'s problem of solving multiplicative matrix equations. Given $k+1$ square matrices $A_{1}, \ldots, A_{k}, C$, all of the same dimension, whose entries are real algebraic, we…

This paper establishes new upper bounds for the sum of the $k$ largest eigenvalues of symmetric matrices. When applied to the adjacency matrix of a graph, our results improve upon a related bound due to Mohar {\bf [On the sum of k largest…

For a graph G, M(G) denotes the maximum multiplicity occurring of an eigenvalue of a symmetric matrix whose zero-nonzero pattern is given by edges of G. We introduce two combinatorial graph parameters T^-(G) and T^+(G) that give a lower and…

Intertwining analysis, algebra, numerical analysis and optimization, computing conjugate co-gradients of real-valued quotients gives rise to eigenvalue problems. In the linear Hermitian case, by inspecting optimal quotients in terms of…

Let $A = [a_{i j}]_{i,j=1}^n$ be a nonnegative matrix with $a_{1 1} = 0$. We prove some lower bounds for the spread $s(A)$ of $A$ that is defined as the maximum distance between any two eigenvalues of $A$. If $A$ has only two distinct…

In this paper, we give estimates for both upper and lower bounds of eigenvalues of a simple matrix. The estimates are shaper than the known results.

In this note, we investigate upper bounds of the Neumann eigenvalue problem for the Laplacian of a bounded domain (with smooth boundary) in a given complete (not compact a priori) Riemannian manifold with Ricci bounded below . For this, we…

Motivated by recent works on statistics of matrices over sets of number theoretic interest, we study matrices with entries from arbitrary finite subsets $\mathcal A$ of finite rank multiplicative groups infields of characteristic zero. We…

We show how positive unital linear maps can be used to obtain some bounds for the eigenvalues of nonnegative matrices.

This paper presents a fast and powerful method for the computation of eigenvalue bounds for Hessian matrices $\nabla^2 \varphi(x) $ of nonlinear functions $\varphi: U \subseteq R^n\rightarrow R$ on hyperrectangles $B \subset U$. The method…

In this paper, we consider the bounds for the largest eigenvalue and the sum of the $k$ largest Laplacian eigenvalues of signed graphs. Firstly, we give an upper bound on the largest eigenvalue of the adjacency matrix of a signed graph and…

We focus on the estimating problem of the infinity norm of the inverse of Nekrasov matrices, give new bounds which involve a parameter, and then determine the optimal value of the parameter such that the new bounds are better than those in…

The primary aim of this paper is to establish bounds on the joint spectral radius for a finite set of nonnegative matrices based on their diagonal elements. The efficacy of this approach is evaluated in comparison to existing and related…

Let $\|A\|_{p,q}$ be the norm induced on the matrix $A$ with $n$ rows and $m$ columns by the H\"older $\ell_p$ and $\ell_q$ norms on $R^n$ and $R^m$ (or $C^n$ and $C^m$), respectively. It is easy to find an upper bound for the ratio…

A mixed tree is a tree in which both directed arcs and undirected edges may exist. Let $T$ be a mixed tree with $n$ vertices and $m$ arcs, where an undirected edge is counted twice as arcs. Let $A$ be the adjacency matrix of $T$. For…

We show several sharp upper and lower bounds for the sum of the largest eigenvalues of the signless Laplacian matrix. These bounds improve and extend previously known bounds.

In this work we present a framework for studying the eigenvalues of a family of matrices with a particular displacement structure. The family admits a specific decomposition as the product of an upper and a lower triangular matrices having…