pith. sign in

arxiv: 1706.02132 · v2 · pith:POLNB7FVnew · submitted 2017-06-07 · 🧮 math.NA · cs.NA

Newton correction methods for computing real eigenpairs of symmetric tensors

classification 🧮 math.NA cs.NA
keywords eigenpairsrealmethodsymmetrictensorsconditionsconvergenceiterative
0
0 comments X
read the original abstract

Real eigenpairs of symmetric tensors play an important role in multiple applications. In this paper we propose and analyze a fast iterative Newton-based method to compute real eigenpairs of symmetric tensors. We derive sufficient conditions for a real eigenpair to be a stable fixed point for our method, and prove that given a sufficiently close initial guess, the convergence rate is quadratic. Empirically, our method converges to a significantly larger number of eigenpairs compared to previously proposed iterative methods, and with enough random initializations typically finds all real eigenpairs. In particular, for a generic symmetric tensor, the sufficient conditions for local convergence of our Newton-based method hold simultaneously for all its real eigenpairs.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.