Algebraic Geometry and Eigenvalues of Tensors

来源 :2016年张量和矩阵学术研讨会(International conference on Tensor, Matrix a | 被引量 : 0次 | 上传用户:Jesses41
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
  In this talk, we will discuss eigenvalues of tensors using Algebraic Geometry. We will define multiplicities of eigenvalues of tensors, which are generalizations of multiplicities of eigenvalues of matrices. It is well known that the geometric multiplicity of an eigenvalue of a matrix is no more than its the algebraic multiplicity. We will discuss a similar relation for tensors. If time permits, we will also discuss the inverse eigenvalue problem for tensors. We will show that the behavior of eigenvalues of tensors is very different from that of matrices. This is a joint work with Shenglong Hu.
其他文献
  An iterative method for calculating the largest eigenvalue of a nonnegative tensor was proposed by Ng, Qi and Zhou in 2009. In this paper, two extrapolated
会议
  In this presentation, we would like to investigate some adaptive gradient methods for generalized tensor eigenvalue complementarity problem (TEiCP). Firstly
会议
  Computing a few eigenpairs from large-scale symmetric eigenvalue problems is far beyond the tractability of classic eigensolvers when the storage of the eig
会议
  This talk is concerned with solving some structured multi-linear systems, especially focusing on the equations whose coeffcient tensors are M-tensors, or ca
会议
  In this talk I will talk about the latest development of applications of tensor theory to probability and statistics. Those include the moment tensor of ran
会议
  Transition probability tensors of order 3 in dimension 3 and of order 4 in dimension 2 are studied. In both cases, we prove that an irreducible symmetric tr
会议
  Low rank tensor learning, such as low rank tensor approximation, tensor completion, as well as multilinear multitask learning, draws much attention in recen
会议
  In this talk, some recent results on adjacency, singless Laplacian and Laplacian H-eigenvalues of hypergraphs are reported. In particular, we investigate k-
会议
  Let △ be a probability simplex, let △t be the Cartesian product of t copies of △, and let f be a t-linear map from △t to △. We consider the iterations
会议
  This talk will introduce some old and new results on the spectral radius of digraphs with described arcs. In particular, we characterize all extremal graphs
会议