arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1401.1183math.NAcs.NA
收藏

一种自适应移位幂方法用于计算广义张量特征对

An Adaptive Shifted Power Method for Computing Generalized Tensor Eigenpairs

Sandia National Laboratories(桑迪亚国家实验室)

Tamara G. Kolda, Jackson R. Mayo

AI总结:

本文提出了一种自适应移位幂方法(GEAP),用于计算广义张量特征对,改进了传统移位对称高阶幂方法(SS-HOPM)的移位选择问题,实现自动适应性。

摘要:

在过去十年中,已经提出了几种张量特征对定义,但这些都可以统一在广义张量特征对框架下,由Chang、Pearson和Zhang(2009)引入。给定m阶、n维的实对称张量A和B,目标是找到λ∈R和x∈R^n,x≠0,使得Ax^{m-1}=λBx^{m-1}。不同的B选择会导致不同的张量特征值问题。我们提出了广义特征问题自适应幂方法(GEAP)来解决这个问题,这是寻找Z特征对的移位对称高阶幂方法(SS-HOPM)的扩展。SS-HOPM的一个主要缺点是其性能依赖于选择适当的移位,但我们的GEAP方法也包括一个自适应方法,自动选择移位。

英文摘要:

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 (2009). Given mth-order, n-dimensional real-valued symmetric tensors A and B, the goal is to find $λ\in R$ and $x \in R^n$, $x \neq 0$, such that $Ax^{m-1} = λBx^{m-1}$. Different choices for B yield different versions of the tensor eigenvalue problem. We present our generalized eigenproblem adaptive power method (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 was that its performance depended in choosing an appropriate shift, but our GEAP method also includes an adaptive method for choosing the shift automatically.

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

↑