【摘 要】
：
The best rank one approximation problem takes an important position in the research of tensors. In this talk, I will present a canonical form of a tensor th
【机 构】
：
LiaoChengUniversity
【出 处】
：
2016年张量和矩阵学术研讨会(International conference on Tensor, Matrix a
论文部分内容阅读
The best rank one approximation problem takes an important position in the research of tensors. In this talk, I will present a canonical form of a tensor through a specific multi-linear orthonormal transformation. Then, I focus my attention on some basic properties related to the best rank one approximation, such as rank, uniqueness, invariance of perturbation, and so on. In the process, some examples will be given to illustrate the correctness of the results obtained.
其他文献
Let m, m, n be positive integers. Let A be an mth order n-dimensional complex tensor and B be an m0th order n-dimensional complex tensor. Suppose that Bxm i
Two major tools in the study of multi-relational datasets are (i) higher-order Markov chains and (ii) linear algebra-inspired computations on hypermatrices
It is known that computing the largest(smallest) Z-eigenvalue of a symmetric ten-sor is equivalent to maximizing(minimizing) a homogeneous polynomial over t
The nonnegative tensor (matrix) factorization finds more and more applications in various disciplines including machine learning, data mining, and blind sou
In this talk, we discuss the partition of a nonnegative tensor which is intended for finding its spectral radius via the spectral radii of its principal blo
In this talk, we consider a class of n-person noncooperative games, where the utility function of every player is given by a homogeneous polynomial defined
In this talk, we try to generalize the construction of circulant preconditioners from matrix to tensor. The preconditioners could be used to solve linear or
We consider the numerical solution of a c-stable linear equation in the tensor product space Rn1×···×nd, arising from a discretized elliptic partial di
Hillar and Lim famously demonstrated that multilinear (tensor) analogues of many efficiently computable problems in numerical linear algebra are NP-hard". D
There are so many deep aspects of real positive-semi-definite quadratic forms (alias, symmetric matrices or symmetric second order tensors) and their genera