An Adaptive Shifted Power Method for Computing Generalized Tensor Eigenpairs

DOI10.1137/140951758zbMath1318.65019arXiv1401.1183OpenAlexW3105081413MaRDI QIDQ5246495

Publication date: 21 April 2015

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.1183

zbMATH Keywords

numerical test tensor eigenvalues shifted symmetric higher-order power method Z-eigenpairs $l^2$-eigenpairs E-eigenpairs generalized eigenproblem adaptive power method generalized tensor eigenpairs

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18) Multilinear algebra, tensor calculus (15A69)

Related Items

A trust region algorithm for computing extreme eigenvalues of tensors ⋮ Further results for $Z$-eigenvalue localization theorem for higher-order tensors and their applications ⋮ An adaptive gradient method for computing generalized tensor eigenpairs ⋮ Newton Correction Methods for Computing Real Eigenpairs of Symmetric Tensors ⋮ Riemannian conjugate gradient methods for computing the extreme eigenvalues of symmetric tensors ⋮ Computing extreme eigenvalues of large scale Hankel tensors ⋮ Pseudo-spectra theory of tensors and tensor polynomial eigenvalue problems ⋮ $Z$-eigenvalue inclusion theorem of tensors and the geometric measure of entanglement of multipartite pure states ⋮ A self-adaptive trust region method for extreme $\mathcal {B}$-eigenvalues of symmetric tensors ⋮ Tensor logarithmic norm and its applications ⋮ An adaptive cubic regularization algorithm for computing H- and Z-eigenvalues of real even-order supersymmetric tensors ⋮ Dominant Z-Eigenpairs of Tensor Kronecker Products Decouple ⋮ Approximate real symmetric tensor rank ⋮ A family of gradient methods using Householder transformation with application to hypergraph partitioning ⋮ A projection method based on discrete normalized dynamical system for computing C-eigenpairs ⋮ Noda iteration for computing generalized tensor eigenpairs ⋮ Feasible Newton methods for symmetric tensor Z-eigenvalue problems ⋮ Calculations for D-eigenvalues of a diffusion kurtosis tensor ⋮ Generalized minimal Gershgorin set for tensors ⋮ A MODIFIED FR CONJUGATE GRADIENT METHOD FOR COMPUTING -EIGENPAIRS OF SYMMETRIC TENSORS ⋮ Spectral projected gradient methods for generalized tensor eigenvalue complementarity problems ⋮ Computing the $p$-spectral radii of uniform hypergraphs with applications ⋮ Computing the generalized eigenvalues of weakly symmetric tensors ⋮ Computing the largest H-eigenvalue of large-scale tensors generated from directed hypergraphs ⋮ Computing Tensor Eigenvalues via Homotopy Methods ⋮ Computing Tensor $Z$-Eigenvectors with Dynamical Systems ⋮ Perturbation bounds of tensor eigenvalue and singular value problems with even order ⋮ Symmetric tensor decomposition by an iterative eigendecomposition algorithm ⋮ A convergent Newton algorithm for computing Z-eigenvalues of an almost nonnegative irreducible tensor ⋮ Shifted eigenvalue decomposition method for computing C-eigenvalues of a piezoelectric-type tensor ⋮ A subspace modified Broyden-Fletcher-Goldfarb-Shanno method for $\mathcal{B} $-eigenvalues of symmetric tensors ⋮ Iterative methods for computing U-eigenvalues of non-symmetric complex tensors with application in quantum entanglement ⋮ Shifted power method for computing tensor H-eigenpairs ⋮ Computing Eigenvalues of Large Scale Sparse Tensors Arising from a Hypergraph ⋮ Pseudospectra localizations for generalized tensor eigenvalues to seek more positive definite tensors ⋮ Generalized Tensor Eigenvalue Problems ⋮ The geometric measure of entanglement of multipartite states and the $Z$-eigenvalue of tensors ⋮ Numerical optimization for symmetric tensor decomposition ⋮ Three Hypergraph Eigenvector Centralities