Related papers: An unconstrained optimization approach for finding…
This paper discusses the computation of real Z-eigenvalues and H-eigenvalues of nonsymmetric tensors. A general nonsymmetric tensor has finitely many Z-eigenvalues, while there may be infinitely many ones for special tensors. In the…
In this paper, we propose an unconstrained framework for eigenvalue problems in both discrete and continuous settings. We begin our discussion to solve a generalized eigenvalue problem $A{\bf x} = \lambda B{\bf x}$ with two $N\times N$ real…
In this paper, the concepts of Pareto $H$-eigenvalue and Pareto $Z$-eigenvalue are introduced for studying constrained minimization problem and the necessary and sufficient conditions of such eigenvalues are given. It is proved that a…
M-eigenvalues of fourth order hierarchically symmetric tensors play a significant role in nonlinear elastic material analysis and quantum entanglement problems. This paper focuses on computing extreme M-eigenvalues for such tensors. To…
This article introduces an algebraic framework for establishing eigenvalue bounds for symmetric positive definite tensors by leveraging intrinsic invariants, specifically the trace and determinant (resultant). We derive a hierarchy of…
Stimulated by odd-bipartite and even-bipartite hypergraphs, we define odd-bipartite (weakly odd-bipartie) and even-bipartite (weakly even-bipartite) tensors. It is verified that all even order odd-bipartite tensors are irreducible tensors,…
This paper studies the problem of selecting a submatrix of a positive definite matrix in order to achieve a desired bound on the smallest eigenvalue of the submatrix. Maximizing this smallest eigenvalue has applications to selecting input…
This paper studies how to compute all real eigenvalues of a symmetric tensor. As is well known, the largest or smallest eigenvalue can be found by solving a polynomial optimization problem, while the other middle eigenvalues can not. We…
We study M-tensors and various properties of M-tensors are given. Specially, we show that the smallest real eigenvalue of M-tensor is positive corresponding to a nonnegative eigenvector. We propose an algorithm to find the smallest positive…
This paper is concerned with the interplay between statistical asymmetry and spectral methods. Suppose we are interested in estimating a rank-1 and symmetric matrix $\mathbf{M}^{\star}\in \mathbb{R}^{n\times n}$, yet only a randomly…
This paper studies tensor eigenvalue complementarity problems. Basic properties of standard and complementarity tensor eigenvalues are discussed. We formulate tensor eigenvalue complementarity problems as constrained polynomial…
We study ill-conditioned positive definite matrices that are disturbed by the sum of $m$ rank-one matrices of a specific form. We provide estimates for the eigenvalues and eigenvectors. When the condition number of the initial matrix tends…
Efficient solvers for tensor eigenvalue problems are important tools for the analysis of higher-order data sets. Here we introduce, analyze and demonstrate an extrapolation method to accelerate the widely used shifted symmetric higher order…
The covariance tensors in statistics{, elasticity tensor in solid mechanics, Riemann curvature tensor in relativity theory are all biquadratic tensors that are weakly symmetric, but not symmetric in general. Motivated by this, in this…
In an instance of the minimum eigenvalue problem, we are given a collection of $n$ vectors $v_1,\ldots, v_n \subset {\mathbb{R}^d}$, and the goal is to pick a subset $B\subseteq [n]$ of given vectors to maximize the minimum eigenvalue of…
We consider random matrices of the form $H = W + \lambda V$, $\lambda\in\mathbb{R}^+$, where $W$ is a real symmetric or complex Hermitian Wigner matrix of size $N$ and $V$ is a real bounded diagonal random matrix of size $N$ with i.i.d.\…
Assume that the eigenvalues of a finite hermitian linear operator have been deduced accurately but the linear operator itself could not be determined with precision. Given a set of eigenvalues $\lambda$ and a hermitian matrix $M$, this…
We study the problem of approximating the eigenspectrum of a symmetric matrix $\mathbf A \in \mathbb{R}^{n \times n}$ with bounded entries (i.e., $\|\mathbf A\|_{\infty} \leq 1$). We present a simple sublinear time algorithm that…
This paper is concerned with computations of a few smaller eigenvalues (in absolute value) of a large extremely ill-conditioned matrix. It is shown that smaller eigenvalues can be accurately computed for a diagonally dominant matrix or a…
The maximum (or minimum) generalized eigenvalue of symmetric positive semidefinite matrices that depend on optimization variables often appears as objective or constraint functions in structural topology optimization when we consider…