对称张量的对称分解及其最佳低秩逼近-基础数学专业论文.docxVIP

摘 要 张量是矩阵的高阶推广，随着传统的矩阵理论在处理数据上体现出来的局 限性，张量分析成为科学与工程领域中应用的一个重要工具，其中张量的分解 与张量的最佳低秩逼近问题是近来研究的热点之一，其在许多方面比如信号处 理，通信数据，计算机视觉，以及图像处理等上有着及其广泛的运用，对称张 量是张量中非常特殊且重要的一类，可看成是对称矩阵的高阶推广，也是近年 来研究的热门话题. 本文的主要工作分为两个部分，第一部分即第三章，主要研究对称张量对 称分解唯一性的问题，首先推导出三阶对称张量对称分解唯一性的充分条件， 由此推导出任意阶对称张量对称分解唯一性的充分条件，本文的第二部分则主 要研究了关于对称张量最佳对称低秩逼近问题，首先我们证明了对任意阶对称 张量，均存在最佳对称秩-1 逼近，其次，我们讨论了当对称张量 A 的对称秩 ranks ( A) ??r 时，对于阶数大于 2 的高阶对称张量，一般情况下并不存在最佳 秩-r 逼近，证明对某些特殊的 k 阶对称张量，其不存在最佳秩-2 逼近，最后， 当我们将条件限定为非负时，我们证明了非负对称张量必定存在最佳非负对称 秩-r 逼近. 关键词：张量；多维数组；对称张量；对称分解；对称张量的秩；低秩逼近 ABSTRACT A tensor is a higher order generalization of a matrix, because of the limitation of traditional matrix theory in processing data , tensor analysis become a very important tool in science and engineering field, tensor decomposition and the best low rank approximation is one of the hot spots in the recent research, it plays an important role in many fields such as the signal processing, data communication, computer vision, and image processing, symmetric tensor is a very special class of tensor, it can be thought as a higher order generalization of a symmetric matrix, recently it also become a hot topic. This article can be divided into two parts, the first part is the third chapter, we main research the uniqueness of symmetric decomposition of symmetric tensor, first we derived the uniqueness sufficient condition of symmetric decomposition of three order symmetric tensors, and thus deduces to any order, part two of this article is mainly about the best symmetric low rank approximation of symmetrical tensors, first we proved that for any symmetric tensor of arbitrary order, they all have a best symmetric rank 1 approximation, secondly, we discuss that when the symmetric rank of a symmetric tensor has ranks ( A) ??r , and its order is more than 2,then A does not have the best rank-1 approximation, we also prove that some special k order symmetric tensor dosent have the best rank-r approximation, and at the end, when the condition is limited