Computing tensor Z-eigenvectors with dynamical systems

05/02/2018
by   Austin R. Benson, et al.
0

We present a new framework for computing Z-eigenvectors of general tensors based on numerically integrating a dynamical system that must converge to a Z-eigenvector. Our motivation comes from our recent research on spacey random walks, where the long-term dynamics of a stochastic process are governed by a dynamical system that must converge to a Z-eigenvectors of a given transition probability tensor. Here, we apply the ideas more broadly to general tensors and find that our method can compute Z-eigenvectors that algebraic methods like the higher-order power method cannot compute.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/09/2019

Subspace power method for symmetric tensor decomposition and generalized PCA

We introduce the Subspace Power Method (SPM) for decomposing symmetric e...
research
12/14/2020

A Krylov-Schur like method for computing the best rank-(r_1,r_2,r_3) approximation of large and sparse tensors

The paper is concerned with methods for computing the best low multiline...
research
08/31/2021

A New Approach to Multilinear Dynamical Systems and Control

The current paper presents a new approach to multilinear dynamical syste...
research
09/05/2018

Learning Paths from Signature Tensors

Matrix congruence extends naturally to the setting of tensors. We apply ...
research
07/10/2019

Higher-order ergodicity coefficients for stochastic tensors

Ergodicity coefficients for stochastic matrices provide valuable upper b...
research
07/10/2019

Higher-order ergodicity coefficients

Ergodicity coefficients for stochastic matrices provide valuable upper b...
research
09/08/2021

An efficient jet marcher for computing the quasipotential for 2D SDEs

We present a new algorithm, the efficient jet marching method (EJM), for...

Please sign up or login with your details

Forgot password? Click here to reset