New iterative criteria for strong [Formula: see text]-tensors and an application.

Jingjing Cui, Guohua Peng, Quan Lu, Zhengge Huang
Author Information
  1. Jingjing Cui: Department of Applied Mathematics, Northwestern Polytechnical University, Xi'an, Shaanxi 710072 P.R. China.
  2. Guohua Peng: Department of Applied Mathematics, Northwestern Polytechnical University, Xi'an, Shaanxi 710072 P.R. China.
  3. Quan Lu: Department of Applied Mathematics, Northwestern Polytechnical University, Xi'an, Shaanxi 710072 P.R. China.
  4. Zhengge Huang: Department of Applied Mathematics, Northwestern Polytechnical University, Xi'an, Shaanxi 710072 P.R. China.

Abstract

Strong [Formula: see text]-tensors play an important role in identifying the positive definiteness of even-order real symmetric tensors. In this paper, some new iterative criteria for identifying strong [Formula: see text]-tensors are obtained. These criteria only depend on the elements of the tensors, and it can be more effective to determine whether a given tensor is a strong [Formula: see text]-tensor or not by increasing the number of iterations. Some numerical results show the feasibility and effectiveness of the algorithm.

Keywords

Word Cloud

Created with Highcharts 10.0.0[Formula:seetext]-tensorsstrongcriteriaidentifyingpositivedefinitenesstensorsiterativeelementsStrongplayimportantroleeven-orderrealsymmetricpapernewobtaineddependcaneffectivedeterminewhethergiventensortext]-tensorincreasingnumberiterationsnumericalresultsshowfeasibilityeffectivenessalgorithmNewapplicationirreduciblenon-zerochain

Similar Articles

Cited By