Computing the largest H-eigenvalue of large-scale tensors generated from directed hypergraphs

DOI10.1007/S40314-021-01554-YMaRDI QIDQ2244993zbMATH OpenOpenAlexWikidataFDO

Authors Xin Zhang, Qin Ni, Zhou Sheng, Zhili Ge

Publication date 12 November 2021

Published in Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s40314-021-01554-y

zbMATH Keywords

conjugate gradient methodH-eigenvaluelarge-scale directed hypergraphs

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Multilinear algebra, tensor calculus (15A69) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Nonlinear programming (90C30) Hypergraphs (05C65)

Recommendations

• Computing eigenvalues of large scale sparse tensors arising from a hypergraph
• Computing extreme eigenvalues of large scale Hankel tensors
• Spectral directed hypergraph theory via tensors
• Efficient algorithms for computing the largest eigenvalue of a nonnegative tensor
• A tensor optimization algorithm for computing Lagrangians of hypergraphs
• A semidefinite program approach for computing the maximum eigenvalue of a class of structured tensors and its applications in hypergraphs and copositivity test.
• A homotopy method for computing the largest eigenvalue of an irreducible nonnegative tensor
• Computing the largest C-eigenvalue of a tensor using convex relaxation
• Eigenvalues of the adjacency tensor on products of hypergraphs
• Least H-eigenvalue of adjacency tensor of hypergraphs with cut vertices

Cites work

• scientific article; zbMATH DE number 3503283 (Why is no real title available?)
• scientific article; zbMATH DE number 1764950 (Why is no real title available?)
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• scientific article; zbMATH DE number 3400923 (Why is no real title available?)
• A Characterization of Soft Hypergraphs
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• A Theorem on Graphs, with an Application to a Problem of Traffic Control
• A characterization of totally balanced hypergraphs
• A convergent Newton algorithm for computing Z-eigenvalues of an almost nonnegative irreducible tensor
• A cubically convergent method for solving the largest eigenvalue of a nonnegative irreducible tensor
• A derivative-free PRP method for solving large-scale nonlinear systems of equations and its global convergence
• A derivative-free method for solving large-scale nonlinear systems of equations
• A new cubic convergent method for solving a system of nonlinear equations
• A note on two problems in connexion with graphs
• A polynomial time approximation scheme for embedding a directed hypergraph on a ring
• A quadratically convergent algorithm for finding the largest eigenvalue of a nonnegative homogeneous polynomial map
• An adaptive gradient method for computing generalized tensor eigenpairs
• An adaptive shifted power method for computing generalized tensor eigenpairs
• Application of hypergraph theory in chemistry
• Circulant tensors with applications to spectral hypergraph theory and stochastic process
• Computing eigenvalues of large scale sparse tensors arising from a hypergraph
• Critical-Path Planning and Scheduling: Mathematical Basis
• Degrees of acyclicity for hypergraphs and relational database schemes
• Directed hypergraphs and applications
• Eigenvalues of a real supersymmetric tensor
• Finding the largest eigenvalue of a nonnegative tensor
• Further Results for Perron–Frobenius Theorem for Nonnegative Tensors II
• Further results for Perron-Frobenius theorem for nonnegative tensors
• Hypergraph theory. An introduction
• Multilinear PageRank
• On the Best Rank-1 and Rank-(R₁ ,R₂ ,. . .,R_N) Approximation of Higher-Order Tensors
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Perron-Frobenius theorem for nonnegative multilinear forms and extensions
• Perron-Frobenius theorem for nonnegative tensors
• Primitive tensors and directed hypergraphs
• Real eigenvalues of nonsymmetric tensors
• Shifted power method for computing tensor eigenpairs
• Spectra of uniform hypergraphs
• Spectral directed hypergraph theory via tensors
• Spectral residual method without gradient information for solving large-scale nonlinear systems of equations
• Tensor analysis. Spectral theory and special tensors
• The clique and coclique numbers' bounds based on the H-eigenvalues of uniform hypergraphs
• The largest Laplacian and signless Laplacian \(H\)-eigenvalues of a uniform hypergraph
• The largest H-eigenvalue and spectral radius of Laplacian tensor of non-odd-bipartite generalized power hypergraphs
• Z-eigenvalue methods for a global polynomial optimization problem
• \(H^{+}\)-eigenvalues of Laplacian and signless Laplacian tensors

Cited in

(5)

• A tensor optimization algorithm for computing Lagrangians of hypergraphs
• A family of gradient methods using Householder transformation with application to hypergraph partitioning
• A semidefinite program approach for computing the maximum eigenvalue of a class of structured tensors and its applications in hypergraphs and copositivity test.
• Computing extreme eigenvalues of large scale Hankel tensors
• Computing eigenvalues of large scale sparse tensors arising from a hypergraph

Describes a project that uses

Uses Software

• TensorToolbox

This page was built for publication: Computing the largest H-eigenvalue of large-scale tensors generated from directed hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2244993)