REVIEW 1 cited by
Accelerating the Computation of Tensor Z-eigenvalues
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Accelerating the Computation of Tensor Z-eigenvalues
read the original abstract
Efficient solvers for tensor eigenvalue problems are important tools for the analysis of higher-order data sets. Here we introduce, analyze and demonstrate an extrapolation method to accelerate the widely used shifted symmetric higher order power method for tensor $Z$-eigenvalue problems. We analyze the asymptotic convergence of the method, determining the range of extrapolation parameters that induce acceleration, as well as the parameter that gives the optimal convergence rate. We then introduce an automated method to dynamically approximate the optimal parameter, and demonstrate it's efficiency when the base iteration is run with either static or adaptively set shifts. Our numerical results on both even and odd order tensors demonstrate the theory and show we achieve our theoretically predicted acceleration.
Forward citations
Cited by 1 Pith paper
-
Quantum estimates for classical polynomial optimization
A quantum-variational matrix method is proposed for bounding homogeneous polynomials, with converging numerical tensor-eigenvalue estimates and a new conjectured inequality for Biasi's resonant Hamiltonians.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.