arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1504.07413math.NAcs.NA
收藏

计算大规模Hankel张量的特征值

Computing Eigenvalues of Large Scale Hankel Tensors

Zhengzhou University(郑州大学);The Hong Kong Polytechnic University(香港理工大学)

Yannan Chen, Liqun Qi, Qun Wang

AI总结:

本文提出了一种近似非线性搜索优化方法,用于计算大规模Hankel张量的Z-和H特征值,利用快速傅里叶变换实现高效计算,并通过数值实验验证了方法的有效性。

摘要:

大规模张量,包括大规模Hankel张量,在科学和工程中有许多应用。本文提出了一种近似非线性搜索优化方法,用于计算m阶n维Hankel张量的Z-和H特征值,其中n较大。由于快速傅里叶变换,新方法每次迭代的计算成本约为O(mn log(mn))。利用凯莱变换,我们获得了一种有效的非线性搜索方案。然后,我们证明了由新算法生成的迭代序列的每个极限点都是Hankel张量的特征对。不假设二次充分条件,我们通过Kurdyka-Łojasiewicz性质分析了迭代序列的线性收敛速度。最后,报告了Hankel张量的数值实验,其维度可能高达一百万,以展示所提出的非线性搜索方法的效率。

英文摘要:

Large scale tensors, including large scale Hankel tensors, have many applications in science and engineering. In this paper, we propose an inexact curvilinear search optimization method to compute Z- and H-eigenvalues of $m$th order $n$ dimensional Hankel tensors, where $n$ is large. Owing to the fast Fourier transform, the computational cost of each iteration of the new method is about $\mathcal{O}(mn\log(mn))$. Using the Cayley transform, we obtain an effective curvilinear search scheme. Then, we show that every limiting point of iterates generated by the new algorithm is an eigen-pair of Hankel tensors. Without the assumption of a second-order sufficient condition, we analyze the linear convergence rate of iterate sequence by the Kurdyka-Łojasiewicz property. Finally, numerical experiments for Hankel tensors, whose dimension may up to one million, are reported to show the efficiency of the proposed curvilinear search method.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑