Semi-tensor Product Approach to Approximation of the Constrained Joint Spectral Radius

2021 ◽  
Author(s):  
Haoyue Zhang ◽  
Yang Song ◽  
Li Deng
Keyword(s):  
Tensor Product ◽  
Spectral Radius ◽  
Joint Spectral Radius ◽  
Product Approach

scholarly journals Construction and Application of Nine-Tic B-Spline Tensor Product SS

Mathematics ◽  
2019 ◽  
Vol 7 (8) ◽  
pp. 675 ◽  
Author(s):  
Abdul Ghaffar ◽  
Mudassar Iqbal ◽  
Mehwish Bari ◽  
Sardar Muhammad Hussain ◽  
Raheela Manzoor ◽  
...  
Keyword(s):  
Tensor Product ◽  
Spectral Radius ◽  
Execution Time ◽  
Computer Programming ◽  
Surface Modeling ◽  
Hölder Regularity ◽  
Subdivision Scheme ◽  
Joint Spectral Radius ◽  
B Spline ◽  
Holder Regularity

In this paper, we propose and analyze a tensor product of nine-tic B-spline subdivision scheme (SS) to reduce the execution time needed to compute the subdivision process of quad meshes. We discuss some essential features of the proposed SS such as continuity, polynomial generation, joint spectral radius, holder regularity and limit stencil. Some results of the SS using surface modeling with the help of computer programming are shown.

Semi-tensor product approach to networked evolutionary games

2014 ◽  
Vol 12 (2) ◽  
pp. 198-214 ◽  
Author(s):  
Daizhan Cheng ◽  
Hongsheng Qi ◽  
Fehuang He ◽  
Tingting Xu ◽  
Hairong Dong
Keyword(s):  
Tensor Product ◽  
Evolutionary Games ◽  
Product Approach

Finding Cut-Edges and the Minimum Spanning Tree via Semi-Tensor Product Approach

2018 ◽  
Vol 6 (5) ◽  
pp. 459-472
Author(s):  
Xujiao Fan ◽  
Yong Xu ◽  
Xue Su ◽  
Jinhuan Wang
Keyword(s):  
Tensor Product ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
The Matrix ◽  
Product Approach ◽  
Matrix Expression ◽  
Necessary And Sufficient ◽  
Logical Functions

Abstract Using the semi-tensor product of matrices, this paper investigates cycles of graphs with application to cut-edges and the minimum spanning tree, and presents a number of new results and algorithms. Firstly, by defining a characteristic logical vector and using the matrix expression of logical functions, an algebraic description is obtained for cycles of graph, based on which a new necessary and sufficient condition is established to find all cycles for any graph. Secondly, using the necessary and sufficient condition of cycles, two algorithms are established to find all cut-edges and the minimum spanning tree, respectively. Finally, the study of an illustrative example shows that the results/algorithms presented in this paper are effective.

Sign in / Sign up

Export Citation Format

Share Document