We present several upper bounds for the adjacency and signless Laplacian spectral radii of uniform hypergraphs in terms of degree sequences.
Finding the minimal H-eigenvalue of tensors is an important topic in tensor computation and numerical multilinear algebra. This paper is devoted to a sum-of-squares (SOS) algorithm for computing the minimal H-eigenvalues of tensors with some sign structures called extended essentially nonnegative tensors (EEN-tensors), which includes nonnegative tensors as a subclass. In the even-order symmetric case, we first discuss the positive semi-definiteness of EEN-tensors, and show that a positive semi-definite EEN-tensor is a nonnegative tensor or an M-tensor or the sum of a nonnegative tensor and an M-tensor, then we establish a checkable sufficient condition for the SOS decomposition of EEN-tensors. Finally, we present an efficient algorithm to compute the minimal H-eigenvalues of even-order symmetric EEN-tensors based on the SOS decomposition. Numerical experiments are given to show the efficiency of the proposed algorithm.
Let m,
We treat even-order tensors with Einstein product as linear operators from tensor space to tensor space, define the null spaces and the ranges of tensors, and study their relationship. We extend the fundamental theorem of linear algebra for matrix spaces to tensor spaces. Using the new relationship, we characterize the least-squares (
An algorithm is presented for decomposing a symmetric tensor into a sum of rank-1 symmetric tensors. For a given tensor, by using apolarity, catalecticant matrices and the condition that the mapping matrices are commutative, the rank of the tensor can be obtained by iteration. Then we can find the generating polynomials under a selected basis set. The decomposition can be constructed by the solutions of generating polynomials under the condition that the solutions are all distinct which can be guaranteed by the commutative property of the matrices. Numerical examples demonstrate the efficiency and accuracy of the proposed method.
Let
We give a further study on B-tensors and introduce doubly B-tensors that contain B-tensors. We show that they have similar properties, including their decompositions and strong relationship with strictly (doubly) diagonally dominated tensors. As an application, the properties of B-tensors are used to localize real eigenvalues of some tensors, which would be very useful in verifying the positive semi-definiteness of a tensor.
A supertree is a connected and acyclic hypergraph. For a hypergraph H,the maximal modulus of the eigenvalues of its adjacency tensor is called the spectral radius of H.By applying the operation of moving edges on hypergraphs and the weighted incidence matrix method, we determine the ninth and the tenth k-uniform supertrees with the largest spectral radii among all k-uniform supertrees on nvertices, which extends the known result.
We consider approximation algorithms for nonnegative polynomial optimization problems over unit spheres. These optimization problems have wide applications e.g., in signal and image processing, high order statistics, and computer vision. Since these problems are NP-hard, we are interested in studying on approximation algorithms. In particular, we propose some polynomial-time approximation algorithms with new approximation bounds. In addition, based on these approximation algorithms, some efficient algorithms are presented and numerical results are reported to show the efficiency of our proposed algorithms.
We consider an MX=M=c queue with catastrophes and state-dependent control at idle time. Properties of the queues which terminate when the servers become idle are first studied. Recurrence, equilibrium distribution, and equilibrium queue-size structure are studied for the case of resurrection and no catastrophes. All of these properties and the first effective catastrophe occurrence time are then investigated for the case of resurrection and catastrophes. In particular, we obtain the Laplace transform of the transition probability for the absorbing MX=M=c queue.
A method based on higher-order partial differential equation (PDE) numerical scheme are proposed to obtain the transition cumulative distribution function (CDF) of the diffusion process (numerical differentiation of the transition CDF follows the transition probability density function (PDF)), where a transformation is applied to the Kolmogorov PDEs first, then a new type of PDEs with step function initial conditions and 0, 1 boundary conditions can be obtained. The new PDEs are solved by a fourth-order compact difference scheme and a compact difference scheme with extrapolation algorithm. After extrapolation, the compact difference scheme is extended to a scheme with sixth-order accuracy in space, where the convergence is proved. The results of the numerical tests show that the CDF approach based on the compact difference scheme to be more accurate than the other estimation methods considered; however, the CDF approach is not time-consuming. Moreover, the CDF approach is used to fit monthly data of the Federal funds rate between 1983 and 2000 by CKLS model.
Let
For a holomorphic function f defined on a strongly pseudo-convex domain in
Linear mixed effects models with general skew normal-symmetric (SNS) error are considered and several properties of the SNS distributions are obtained. Under the SNS settings, ANOVA-type estimates of variance components in the model are unbiased, the ANOVA-type F-tests are exact F-tests in SNS setting, and the exact confidence intervals for fixed effects are constructed. Also the power of ANOVA-type F-tests for components are free of the skewing function if the random effects normally distributed. For illustration of the main results, simulation studies on the robustness of the models are given by comparisons of multivariate skew-normal, multivariate skew normal-Laplace, multivariate skew normal-uniform, multivariate skew normal-symmetric, and multivariate normal distributed errors. A real example is provided for the illustration of the proposed method.
H is called an
We prove that there are infinite cube-free numbers of the form