An Adaptive Shifted Power Method for Computing Generalized Tensor Eigenpairs
An Adaptive Shifted Power Method for Computing Generalized Tensor Eigenpairs
复制标题
DOI:
10.1137/140951758
复制
发表时间:
2014-01
期刊:
影响因子:
--
通讯作者:
T. Kolda;J. Mayo
中科院分区:
文献类型:
--
作者:
T. Kolda;J. Mayo
Several tensor eigenpair definitions have been put forth in the past decade, but these can all be unified under generalized tensor eigenpair framework, introduced by Chang, Pearson, and Zhang [J. Math. Anal. Appl., 350 (2009), pp. 416--422]. Given mth-order, n-dimensional real-valued symmetric tensors ${\mathscr{A}}$ and $\boldsymbol{\mathscr{B}}$, the goal is to find $\lambda \in \mathbb{R}$ and $\mathbf{x} \in \mathbb{R}^{n}, \mathbf{x} \neq 0$ such that ${\mathscr{A}}\mathbf{x}^{m-1} = \lambda {\mathscr{B}}\mathbf{x}^{m-1}$. Different choices for ${\mathscr{B}}$ yield different versions of the tensor eigenvalue problem. We present our generalized eigenproblem adaptive power (GEAP) method for solving the problem, which is an extension of the shifted symmetric higher-order power method (SS-HOPM) for finding Z-eigenpairs. A major drawback of SS-HOPM is that its performance depended on choosing an appropriate shift, but our GEAP method also includes an adaptive method for choosing the shift automatically.