Related papers: Generalized Eigenvalue Complementarity Problem for…

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…

We prove that multilinear (tensor) analogues of many efficiently computable problems in numerical linear algebra are NP-hard. Our list here includes: determining the feasibility of a system of bilinear equations, deciding whether a 3-tensor…

It is well-known that the finite difference discretization of the Laplacian eigenvalue problem $-\Delta u = \lambda u$ leads to a matrix eigenvalue problem (EVP) $A x= \lambda x$ where the matrix $A$ is Toeplitz-plus-Hankel. Analytical…

A generalized eigenvalue algorithm for tridiagonal matrix pencils is presented. The algorithm appears as the time evolution equation of a nonautonomous discrete integrable system associated with a polynomial sequence which has some…

We introduce the concept of shape partition of a tensor and formulate a general tensor eigenvalue problem that includes all previously studied eigenvalue problems as special cases. We formulate irreducibility and symmetry properties of a…

This paper is concerned with solving some structured multi-linear systems, which are called tensor absolute value equations. This kind of absolute value equations is closely related to tensor complementarity problems and is a generalization…

The tensor decomposition addressed in this paper may be seen as a generalisation of Singular Value Decomposition of matrices. We consider general multilinear and multihomogeneous tensors. We show how to reduce the problem to a truncated…

Let $\mathcal{A}$ be an order $t$ dimension $m\times n\times \cdots \times n$ tensor over complex field. In this paper, we study some {generalized inverses} of $\mathcal{A}$, the {$k$-T-idempotent tensors} and the idempotent tensors based…

We propose a simple generalization of the matrix resolvent to a resolvent for real symmetric tensors $T\in \otimes^p \mathbb{R}^N$ of order $p\ge 3$. The tensor resolvent yields an integral representation for a class of tensor invariants…

For the singular saddle-point problems with nonsymmetric positive definite $(1,1)$ block, we present a general constraint preconditioning (GCP) iteration method based on a singular constraint preconditioner. Using the properties of the…

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 introduce two parabolic target-space interior-point algorithms for solving monotone linear complementarity problems. The first algorithm is based on a universal tangent direction, which has been recently proposed for…

We are interested in finding a solution to the tensor complementarity problem with a strong M-tensor, which we call the M-tensor complementarity problem. We propose a lower dimensional linear equation approach to solve that problem. At each…

We construct generic real symmetric tensors with only real eigenvectors or, equivalently, real homogeneous polynomials with the maximum possible finite number of critical points on the sphere.

Our purpose is to investigate the local boundedness, the upper semicontinuity, and the stability of the solution map of tensor complementarity problems. To do this, we focus on the set of R$_0$--tensors and show that this set plays an…

One of the central problems in the theory of linear complementarity problems (LCPs) is to study the class of $Q$-matrices since it characterizes the solvability of LCP. Recently, the concept of $Q$-matrix has been extended to the case of…

We propose a new algorithm for sparse estimation of eigenvectors in generalized eigenvalue problems (GEP). The GEP arises in a number of modern data-analytic situations and statistical methods, including principal component analysis (PCA),…

We introduce a Kojima-Megiddo-Mizuno type continuation method for solving tensor complementarity problems. We show that there exists a bounded continuation trajectory when the tensor is strictly semi-positive and any limit point tracing the…

In this paper we consider the problems of testing isomorphism of tensors, $p$-groups, cubic forms, algebras, and more, which arise from a variety of areas, including machine learning, group theory, and cryptography. These problems can all…

We propose a new solvable one-dimensional complex PT-symmetric potential as $V(x)= ig~ \mbox{sgn}(x)~ |1-\exp(2|x|/a)|$ and study the spectrum of $H=-d^2/dx^2+V(x)$. For smaller values of $a,g <1$, there is a finite number of real discrete…