Solving Multi-linear Systems with M-Tensors

来源 :2016年张量和矩阵学术研讨会(International conference on Tensor, Matrix a | 被引量 : 0次 | 上传用户:yiran87
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
  This talk is concerned with solving some structured multi-linear systems, especially focusing on the equations whose coeffcient tensors are M-tensors, or called M-equations for short. We prove that a nonsingular M-equation with a positive right-hand side always has a unique positive solution. Several iterative algorithms are proposed for solving multi-linear nonsingular M-equations, generalizing the classical iterative methods and the Newton method for linear systems. Furthermore, we apply the M-equations to some nonlinear differential equations and the inverse iteration for spectral radii of nonnegative tensors.
其他文献
  In matrix theory, the Thompson (R. C.) triangle inequality, Golden-Thompson in-equality, and Araki-Lieb-Thirring inequality are well known. In this talk, we
会议
  In machine learning, finance, statistics, and other areas, numerous interesting prob-lems can be modelled into the form of convex composite quadratic conic
会议
  Numerical data are frequently organized as d-dimensional matrices, also called ten-sors. However, only small values of d are allowed if we need to keep this
会议
  Identifying the positive definiteness of an even-order homogeneous multivariate form is an important task due to its wide applications in such as medical im
会议
  In this paper, some new Brauer-type eigenvalue inclusion theorems are established for general tensors. We show that new eigenvalue inclusion sets are sharpe
会议
  In this talk, we first review some results related Sylvester-type matrix equations and matrix decompositions. Then we investigate and analyze in detail the
会议
  A Hankel tensor is called a strong Hankel tensor if the Hankel matrix generated by its generating vector is positive semi-definite. It is known that an even
会议
  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
会议