Related papers: On bounds of matrix eigenvalues
The eigenvalue distribution is investigated for matrix models related via the localization to Chern-Simons-matter theories. An integral representation of the planar resolvent is used to derive the positions of the branch points of the…
We develop several methods, based on the geometric relationship between the eigenspaces of a matrix and its adjoint, for determining whether a square matrix having distinct eigenvalues is unitarily equivalent to a complex symmetric matrix.…
Estimation of individual treatment effects is commonly used as the basis for contextual decision making in fields such as healthcare, education, and economics. However, it is often sufficient for the decision maker to have estimates of…
The extremal eigenvalues including maximum eigenvalues and the minimum eigenvalues about outerplanar graphs are investigated in this paper. Some structural characterizations about the (edge) maximal bipartite outerplanar graphs are…
We improve recent results relating graph eigenvalues to other graph parameters like girth, domination number, and minimum degree.
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…
We determine minimal Cayley--Hamilton and Capelli identities for matrices over a Grassmann algebra of finite rank. For minimal standard identities, we give lower and upper bounds on the degree. These results improve on upper bounds given by…
The standard approach for finding eigenvalues and eigenvectors of matrix polynomials starts by embedding the coefficients of the polynomial into a matrix pencil, known as linearization. Building on the pioneering work of Nakatsukasa and…
We obtain sharp lower bounds for the first eigenvalue of four types of eigenvalue problem defined by the bi-Laplace operator on compact manifolds with boundary and determine all the eigenvalues and the corresponding eigenfunctions of a…
We assume that every element of a matrix has a small, individual error, and model it by an external number, which is the sum of a nonstandard real number and a neutrix, the latter being a convex (external) set having the group property. The…
In the recent paper \cite{1}, Denton et al. provided the eigenvector-eigenvalue identity for Hermitian matrices, and a survey was also given for such identity in the literature. The main aim of this paper is to present the identity related…
We prove various estimates for the first eigenvalue of the magnetic Dirichlet Laplacian on a bounded domain in two dimensions. When the magnetic field is constant, we give lower and upper bounds in terms of geometric quantities of the…
We prove a bound, of Bargmann- Birman-Schwinger type, on the number of eigenvalues of the matrix Schr\"odinger operator on the half line, with the most general self adjoint boundary condition at the origin, and with selfadjoint matrix…
Traditional numerical methods for calculating matrix eigenvalues are prohibitively expensive for high-dimensional problems. Iterative random sparsification methods allow for the estimation of a single dominant eigenvalue at reduced cost by…
We develop a notion of {\em inner rank} as a tool for obtaining lower bounds on the rank of matrix multiplication tensors. We use it to give a short proof that the border rank (and therefore rank) of the tensor associated with $n\times n$…
This note is concerned with the linear matrix equation $X = AX^\top B + C$, where the operator $(\cdot)^\top$ denotes the transpose ($\top$) of a matrix. The first part of this paper set forth the necessary and sufficient conditions for the…
We provide explicit bounds on the eigenvalues of transfer operators defined in terms of holomorphic data.
We introduce higher-order Poincar'e constants for compact weighted manifolds and estimate them from above in terms of subsets. These estimates imply upper bounds for eigenvalues of the weighted Laplacian and the first nontrivial eigenvalue…
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…
Lower bounds for the first and the second eigenvalue of uniform hypergraphs which are regular and linear are obtained. One of these bounds is a generalization of the Alon-Boppana Theorem to hypergraphs.