Gang Wang

Prof. Gang Wang

Qufu Normal University, Qufu, Shandong, China

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 May 2022 in Axioms
Verified
Journal Article
Open access
PDF file
GWGang Wang
Gang Wang
XYXiaoxuan Yang
Xiaoxuan Yang
WSWei Shao
Wei Shao
QHQiuling Hou
Qiuling Hou
The C-eigenpair of piezoelectric tensors finds applications in the area of the piezoelectric effect and converse piezoelectric effect. In this paper, we provide some characterizations of C-eigenvectors by exploring the structure of piezoelectric tensors, and establish sharp C-eigenvalue inclusion intervals via Cauchy–Schwartz inequality. Further, we propose the lower and upper bounds of the largest C-eigenvalue and evaluate the efficiency of the best rank-one approximation of piezoelectric tensors. Numerical examples are proposed to verify the efficiency of the obtained results.

9 July 2021 in Symmetry
Verified
Journal Article
Open access
PDF file
RLRenzhi Lu
Renzhi Lu
YZYing Zhang
Ying Zhang
GWGang Wang
Gang Wang
The positive definiteness of even-order weakly symmetric tensors plays important roles in asymptotic stability of time-invariant polynomial systems. In this paper, we establish two Brauer-type Z-eigenvalue inclusion sets with parameters by Z-identity tensors, and show that these inclusion sets are sharper than existing results. Based on the new Z-eigenvalue inclusion sets, we propose some sufficient conditions for testing the positive definiteness of even-order weakly symmetric tensors, as well as the asymptotic stability of time-invariant polynomial systems. The given numerical experiments are reported to show the efficiency of our results.

17 August 2022 in Symmetry
Verified
Journal Article
Open access
PDF file
GWGang Wang
Gang Wang
JLJinfa Management Liu
Jinfa Management Liu
The irreducibility of nonnegative matrices is an important condition for the diagonal transformation algorithm to succeed. In this paper, we introduce zero symmetry to replace the irreducibility of nonnegative matrices and propose an improved diagonal transformation algorithm for finding the maximum eigenvalue without any partitioning. The improved algorithm retains all of the benefits of the diagonal transformation algorithm while having fewer computations. Numerical examples are reported to show the efficiency of the proposed algorithm. As an application, the improved algorithm is used to check whether a zero symmetric matrix is an H-matrix.