Related papers: Eigenvalues of symmetric tridiagonal interval matr…
We prove that few largest (and most important) eigenvalues of random symmetric matrices of various kinds are very strongly concentrated. This strong concentration enables us to compute the means of these eigenvalues with high precision. Our…
The purpose of this paper is to study the problem of computing unitary eigenvalues (U-eigenvalues) of non-symmetric complex tensors. By means of symmetric embedding of complex tensors, the relationship between U-eigenpairs of a…
We present a fast Jacobi-like algorithm for computing the eigenvalues, and optionally the eigenvectors, of a real normal matrix. The method gains a computational advantage by using Paardekooper's method for skew-symmetric matrices The…
We prove edge universality of local eigenvalue statistics for orthogonal invariant matrix models with real analytic potentials and one interval limiting spectrum. Our starting point is the result of \cite{S:08} on the representation of the…
Recently, three numerical methods for the computation of eigenvalues of singular matrix pencils, based on a rank-completing perturbation, a rank-projection, or an augmentation were developed. We show that all three approaches can be…
Lower bounds on the smallest eigenvalue of a symmetric positive definite matrices $A\in\mathbb{R}^{m\times m}$ play an important role in condition number estimation and in iterative methods for singular value computation. In particular, the…
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…
We explore a certain family $\{A_n\}_{n=1}^{\infty}$ of $n \times n$ tridiagonal real symmetric matrices. After deriving a three-term recurrence relation for the characteristic polynomials of this family, we find a closed form solution. The…
A novel factorization for the sum of two single-pair matrices is established as product of lower-triangular, tridiagonal, and upper-triangular matrices, leading to semi-closed-form formulas for tridiagonal matrix inversion. Subsequent…
Lower bounds estimates are proved for the first eigenvalue for the Dirichlet Laplacian on arbitrary triangles using various symmetrization techniques. These results can viewed as a generalization of P\'olya's isoperimetric bounds. It is…
The aim of this paper is to present new upper bounds for the distance between a properly normalized permanent of a rectangular complex matrix and the product of the arithmetic means of the entries of its columns. It turns out that the…
The principal minors of a tridiagonal matrix satisfy two-term and three-term recurrences [1, 2]. Based on these facts, the current article presents a new efficient and reliable hybrid numerical algorithm for evaluating general n-th order…
In this paper, a rigorous computational method to enclose eigendecompositions of complex interval matrices is proposed. Each eigenpair $x=(\lambda,v)$ is found by solving a nonlinear equation of the form $f(x)=0$ via a contraction argument.…
The eigenvalue problem for the Sen--Witten operator on closed spacelike hypersurfaces is investigated. The (square of its) eigenvalues are shown to be given exactly by the 3-surface integral appearing in the expression of the total…
Let A be an n x n symmetric random matrix whose upper-triangular entries are independent and follow possibly non-identical subgaussian distributions. This paper investigates the spectral properties of A, including its eigenvalues and…
An $n\times n$ matrix is said to have a self-interlacing spectrum if its eigenvalues $\lambda_k$, $k=1,\ldots,n$, are distributed as follows $$ \lambda_1>-\lambda_2>\lambda_3>\cdots>(-1)^{n-1}\lambda_n>0. $$ A method for constructing sign…
In this paper we consider a fully third order nonlinear boundary value problem which is of great interest of many researchers. First we establish the existence, uniqueness of solution. Next, we propose simple iterative methods on both…
We present sharp inequalities relating the number of vertices, edges, and triangles of a graph to the smallest eigenvalue of its adjacency matrix and the largest eigenvalue of its Laplacian.
It is well known that a family of $n\times n$ commuting matrices can be simultaneously triangularized by a unitary similarity transformation. The diagonal entries of the triangular matrices define the $n$ joint eigenvalues of the family. In…
We show that the global minimum (resp. maximum) of a continuous function on a compact set can be approximated from above (resp. from below) by computing the smallest (rest. largest) eigenvalue of a hierarchy of (r x r) tri-diagonal…