Related papers: A new proof of an equality associated with submatr…
We propose in this work a subgradient extragradient method with inertial and correction terms for solving equilibrium problems in a real Hilbert space. We obtain that the sequence generated by our proposed method converges weakly to a point…
I propose a proof of the existence of the existence of eigenvectors and eigenvalues in the spirit of Argand's proof of the fundamental theorem of algebra. The proof only relies on Weierstrass's theorem, the definition of the inverse of a…
Let $A$ be a fixed complex matrix and let $u,v$ be two vectors. The eigenvalues of matrices $A+\tau uv^\top $ $(\tau\in\mathbb{R})$ form a system of intersecting curves. The dependence of the intersections on the vectors $u,v$ is studied.
We study the eigenvalue problem for some special class of anti-triangular matrices. Though the eigenvalue problem is quite classical, as far as we know, almost nothing is known about properties of eigenvalues for anti-triangular matrices.…
Let ({\lambda}, v) be a known real eigenpair of a square real matrix A. In this paper it is shown how to locate the other eigenvalues of A in terms of the components of v. The obtained region is a union of Gershgorin discs of the second…
In this paper we study polynomial maps of vector spaces and their eigenvectors and eigenvalues. The new quantity called complanart is defined. Complanarts determine complanarity of solution vectors of systems of polynomial equations.…
Sub-additive and super-additive inequalities for concave and convex functions have been generalized to the case of matrices by several authors over a period of time. These lead to some interesting inequalities for matrices, which in some…
Some results in random matrices are generalized to supermatrices, in particular supermatrix integration is reduced to an integration over the eigenvalues and the resulting volume element is shown to be equivalent to a one dimensional…
A methodology to analyze the properties of the first (largest) eigenvalue and its eigenvector is developed for large symmetric random sparse matrices utilizing the cavity method of statistical mechanics. Under a tree approximation, which is…
We consider the problem of recovering a unitary eigendecomposition of a complex unitary matrix from that of its embedded real-valued formulation. Such formulations arise naturally in scientific computing workflows that employ…
In this short note we prove that a matrix $A\in\mathbb{R}^{n,n}$ is self-adjoint if and only if it is equivariant with respect to the action of a group $\Gamma\subset {\bf O}(n)$ which is isomorphic to $\otimes_{k=1}^n\mathbf{Z}_2$.…
The problem of classifying all unitary R-matrices of arbitrary finite dimension that have precisely two distinct eigenvalues is described, working up to a natural equivalence relation given by the characters of their braid group…
Linear statistics of eigenvalues in many familiar classes of random matrices are known to obey gaussian central limit theorems. The proofs of such results are usually rather difficult, involving hard computations specific to the model in…
The paper develops Newton's method of finding multiple eigenvalues with one Jordan block and corresponding generalized eigenvectors for matrices dependent on parameters. It computes the nearest value of a parameter vector with a matrix…
In this article, we show multiple inequalities for the singular values of the difference of matrix means. The obtained results refine and complement some well established results in the literature. Although we target singular values…
We present a new eigenvalue method for solving a system of Laurent polynomial equations defining a zero-dimensional reduced subscheme of a toric compactification $X$ of $(\mathbb{C} \setminus \{0\})^n$. We homogenize the input equations to…
This paper establishes new concentration inequalities for random matrices constructed from independent random variables. These results are analogous with the generalized Efron-Stein inequalities developed by Boucheron et al. The proofs rely…
It is proved that the roots of combinations of matrix polynomials with real roots can be recast as eigenvalues of combinations of real symmetric matrices, under certain hypotheses. The proof is based on recent solution of the Lax…
A simple approximate relationship between the ground-state eigenvector and the sum of matrix elements in each row has been established for real symmetric matrices with non-positive off-diagonal elements. Specifically, the $i$-th components…
Pickrell has fully characterized the unitarily invariant probability measures on infinite Hermitian matrices, and an alternative proof of this classification has been found by Olshanski and Vershik. Borodin and Olshanski deduced from this…