A semidefinite program approach for computing the maximum eigenvalue of a class of structured tensors and its applications in hypergraphs and copositivity test

Abstract

SummaryFinding the maximum eigenvalue of a symmetric tensor is an important topic in tensor computation and numerical multilinear algebra. In this paper, we introduce a new class of structured tensors called W-tensors, which not only extends the well-studied nonnegative tensors by allowing negative entries but also covers several important tensors arising naturally from spectral hypergraph theory. We then show that finding the maximum H-eigenvalue of an even-order symmetric W-tensor is equivalent to solving a structured semidefinite program and hence can be validated in polynomial time. This yields a highly efficient semidefinite program algorithm for computing the maximum H-eigenvalue of W-tensors and is based on a new structured sums-of-squares decomposition result for a nonnegative polynomial induced by W-tensors. Numerical experiments illustrate that the proposed algorithm can successfully find the maximum H-eigenvalue of W-tensors with dimension up to 10,000, subject to machine precision. As applications, we provide a polynomial time algorithm for computing the maximum H-eigenvalues of large-size Laplacian tensors of hyperstars and hypertrees, where the algorithm can be up to 13 times faster than the state-of-the-art numerical method introduced by Ng, Qi, and Zhou in 2009. Finally, we also show that the proposed algorithm can be used to test the copositivity of a multivariate form associated with symmetric extended Z-tensors, whose order may be even or odd.

Krylov subspace methods to solve a class of tensor equations via the Einstein product

“…As the extension of matrix computation, tensor computation is the latest research hotspot in the last twenty years . In particular, various kinds of tensor equations arise from mechanics, physics, Markov process, control theory, partial differential equations, and engineering problems .…”

“…As the extension of matrix computation, tensor computation is the latest research hotspot in the last twenty years. [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17] In particular, various kinds of tensor equations arise from mechanics, physics, Markov process, control theory, partial differential equations, and engineering problems. [18][19][20][21][22] The radiation transfer equation, the high-dimensional Poisson equation, the Einstein gravitational field equation, and the piezoelectric effect equation are all tensor equations.…”

“…By the standard central difference approximations, Poisson's equation (3) in two dimensions has the following higher order tensor representation 18 :…”

Further study on tensor absolute value equations

“…In the current numerical analysis literature, considerable interests have arisen in extending concepts from linear algebra to the setting of multilinear algebra due to the powerfulness of the multilinear algebra in the real-world applications, e.g. see [4,11,17,40] and the most recent monograph [30]. Therefore, in this paper, we consider the so-named tensor absolute equations (TAVEs), which refers to the task of finding an x ∈ R n such that…”

The Tensor Pade´-Type Approximant with Application in Computing Tensor Exponential Function

“…Recently, tensor computation, especially eigenvalues of tensors, has attracted attention of many scholars; some important results have been found in the current literature [8][9][10][11][12][13][14][15]. For instance, computation of exp(A ) is required in applications such as finite strain hyperelasticbased multiplicative plasticity models [7,[16][17][18][19].…”