【摘 要】
：
Analytic connectivity is a quantity in spectral hypergraph theory, proposed as a sub-stitute of algebraic connectivity in the case of hypergraphs. It is rel
【机 构】
：
TheStateKeyLaboratoryofScientificandEngineeringComputing
【出 处】
：
2016年张量和矩阵学术研讨会(International conference on Tensor, Matrix a
论文部分内容阅读
Analytic connectivity is a quantity in spectral hypergraph theory, proposed as a sub-stitute of algebraic connectivity in the case of hypergraphs. It is related with some other hypergraph invariants, such as degree, vertex connectivity, diameter and isoperimetric number. The definition of analytic connectivity for a uniform hypergraph involves an optimization problem associated with the Laplacian tensor of that hypergraph and some nonnegativity constraints, linear constraints and a ball constraint. This poses some dif-ficulty to compute it. In this paper, we propose a feasible trust region algorithm to compute analytic connectivity of a uniform hypergraph. Numerical results with some small and large size examples are reported. They show that this algorithm is effcient.
其他文献
In this talk, we consider a class of n-person noncooperative games, where the utility function of every player is given by a homogeneous polynomial defined
In this talk, we try to generalize the construction of circulant preconditioners from matrix to tensor. The preconditioners could be used to solve linear or
We consider the numerical solution of a c-stable linear equation in the tensor product space Rn1×···×nd, arising from a discretized elliptic partial di
Hillar and Lim famously demonstrated that multilinear (tensor) analogues of many efficiently computable problems in numerical linear algebra are NP-hard". D
There are so many deep aspects of real positive-semi-definite quadratic forms (alias, symmetric matrices or symmetric second order tensors) and their genera
The best rank one approximation problem takes an important position in the research of tensors. In this talk, I will present a canonical form of a tensor th
Given a Laurent polynomial with matrix coeffcients that is positive semi-definite over the unit circle in the complex plane, the Fej(e)r-Riesz theorem asser
In this talk, we study the properties of extreme points of 1-stochastic tensors. We give the Birkhoff-von Neumann theorem of the 1-stochastic tensor. Some e
Combinatorial matrix theory deals with the interplay between matrix theory and graph theory/combinatorics. In this talk we present some recent work in this
A matrix A is called monotonically positive (MP) if there exists a columnwise mono-tonic matrix U such that A = U U T . MP-matrices have many applications i