Continuation methods for computing Z-/H-eigenpairs of nonnegative tensors
From MaRDI portal
(Redirected from Publication:1636749)
Abstract: In this paper, a homotopy continuation method for the computation of nonnegative Z-/H-eigenpairs of a nonnegative tensor is presented. We show that the homotopy continuation method is guaranteed to compute a nonnegative eigenpair. Additionally, using degree analysis, we show that the number of positive Z-eigenpairs of an irreducible nonnegative tensor is odd. A novel homotopy continuation method is proposed to compute an odd number of positive Z-eigenpairs, and some numerical results are presented.
Recommendations
- A homotopy method for computing the largest eigenvalue of an irreducible nonnegative tensor
- Computing the dominant eigenpair of an essentially nonnegative tensor via a homotopy method
- A convergent Newton algorithm for computing Z-eigenvalues of an almost nonnegative irreducible tensor
- Computing tensor eigenvalues via homotopy methods
- A modified Newton iteration for finding nonnegative \(Z\)-eigenpairs of a nonnegative tensor
Cites work
- A Positivity Preserving Inverse Iteration for Finding the Perron Pair of an Irreducible Nonnegative Third Order Tensor
- A quadratically convergent algorithm for finding the largest eigenvalue of a nonnegative homogeneous polynomial map
- A survey on the spectral theory of nonnegative tensors.
- Algebraic connectivity of an even uniform hypergraph
- Computing tensor eigenvalues via homotopy methods
- D-eigenvalues of diffusion kurtosis tensors
- Eigenvalues and invariants of tensors
- Eigenvalues of a real supersymmetric tensor
- Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One
- Finding the largest eigenvalue of a nonnegative tensor
- Most tensor problems are NP-hard
- Multilinear PageRank
- Newton-noda iteration for finding the Perron pair of a weakly irreducible nonnegative tensor
- Numerical methods in bifurcation problems. Lectures delivered at the Indian Institute of Science, Bangalore, under the T.I.F.R.-I.I.Sc. Programme in Applications of Mathematics. Notes by A. K. Nandakumaran and Mythily Ramaswamy
- On determinants and eigenvalue theory of tensors
- On the limiting probability distribution of a transition probability tensor
- On the uniqueness and non-uniqueness of the positive \(\mathcal Z\)-eigenvector for transition probability tensors
- Output feedback stabilization and related problems-solution via decision methods
- Perron-Frobenius theorem for nonnegative multilinear forms and extensions
- Perron-Frobenius theorem for nonnegative tensors
- Shifted power method for computing tensor eigenpairs
- Some variational principles for \(Z\)-eigenvalues of nonnegative tensors
- Spectra of uniform hypergraphs
- The Laplacian of a uniform hypergraph
- The degree of the E-characteristic polynomial of an even order tensor
- The largest Laplacian and signless Laplacian \(H\)-eigenvalues of a uniform hypergraph
Cited in
(10)- An SDP relaxation method for Perron pairs of a nonnegative tensor
- Computing tensor eigenvalues via homotopy methods
- A projection method based on discrete normalized dynamical system for computing C-eigenpairs
- Real eigenvalues of nonsymmetric tensors
- Computing the dominant eigenpair of an essentially nonnegative tensor via a homotopy method
- A convergent Newton algorithm for computing Z-eigenvalues of an almost nonnegative irreducible tensor
- An adaptive cubic regularization algorithm for computing H- and Z-eigenvalues of real even-order supersymmetric tensors
- 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
- A modified Newton iteration for finding nonnegative \(Z\)-eigenpairs of a nonnegative tensor
This page was built for publication: Continuation methods for computing Z-/H-eigenpairs of nonnegative tensors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1636749)
