Computing tensor Z-eigenvectors with dynamical systems
From MaRDI portal
Computing tensor \(Z\)-eigenvectors with dynamical systems
Abstract: We present a new framework for computing Z-eigenvectors of general tensors based on numerically integrating a dynamical system that can only 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-eigenvector of a 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.
Recommendations
- Fixed point methods for computing a Z-eigenpair of general square tensors
- A modified FR conjugate gradient method for computing Z-eigenpairs of symmetric tensors
- scientific article; zbMATH DE number 2245554
- Computing tensor Z-eigenvalues via shifted inverse power method
- A convergent Newton algorithm for computing Z-eigenvalues of an almost nonnegative irreducible tensor
Cites work
- A Perron Iteration for the Solution of a Quadratic Vector Equation Arising in Markovian Binary Trees
- Algorithm 862
- All real eigenvalues of symmetric tensors
- An adaptive shifted power method for computing generalized tensor eigenpairs
- Continuous methods for extreme and interior eigenvalue problems
- D-eigenvalues of diffusion kurtosis tensors
- Eigenvalues of a real supersymmetric tensor
- Most tensor problems are NP-hard
- Multilinear PageRank
- Newton correction methods for computing real eigenpairs of symmetric tensors
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- On the best rank-1 approximation of higher-order supersymmetric tensors
- On the limiting probability distribution of a transition probability tensor
- On the solution of a quadratic vector equation arising in Markovian binary trees.
- Perron-based algorithms for the multilinear PageRank
- Real eigenvalues of nonsymmetric tensors
- Semidefinite relaxations for best rank-1 tensor approximations
- Shifted power method for computing tensor eigenpairs
- Symmetric Tensors and Symmetric Tensor Rank
- Tensor approximation and signal processing applications
- Tensor Decompositions and Applications
- Tensor decompositions for learning latent variable models
- The Generalized Toda Flow, the QR Algorithm and the Center Manifold Theory
- The number of eigenvalues of a tensor
- The Spacey Random Walk: A Stochastic Process for Higher-Order Data
- Three hypergraph eigenvector centralities
- Vertex-reinforced random walks and a conjecture of Pemantle
Cited in
(12)- Computing tensor Z-eigenvalues via shifted inverse power method
- Direct methods to compute all \(Z\)-eigenpairs of a tensor with dimension 2 or 3
- Z-eigenvalue intervals of even-order tensors with application to judge the strong ellipticity of an elasticity tensor
- Eigenvalue bounds of third-order tensors via the minimax eigenvalue of symmetric matrices
- Three hypergraph eigenvector centralities
- Dominant Z-Eigenpairs of Tensor Kronecker Products Decouple
- A projection method based on discrete normalized dynamical system for computing C-eigenpairs
- Scalable tensor methods for nonuniform hypergraphs
- Calculations for D-eigenpairs of a diffusion kurtosis tensor
- Spliting iteration method for solving multilinear PageRank problem
- Higher-order reduced rank regression
- A feasible conjugate gradient method for calculating \(\mathcal{B}\)-eigenpairs of symmetric tensors
This page was built for publication: Computing tensor \(Z\)-eigenvectors with dynamical systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5203962)
