A numerical method for one-dimensional nonlinear sine-Gordon equation using multiquadric quasi-interpolationLi-Min, Ma; Zong-Min, Wu
doi: 10.1088/1674-1056/18/8/001pmid: N/A
In this paper, we use a univariate multiquadric quasi-interpolation scheme to solve the one-dimensional nonlinear sine-Gordon equation that is related to many physical phenomena. We obtain a numerical scheme by using the derivative of the quasi-interpolation to approximate the spatial derivative and a difference scheme to approximate the temporal derivative. The advantage of the obtained scheme is that the algorithm is very simple so that it is very easy to implement. The results of numerical experiments are presented and compared with analytical solutions to confirm the good accuracy of the presented scheme.
Automatic generation of min-weighted persistent formationsXiao-Yuan, Luo; Shao-Bao, Li; Xin-Ping, Guan
doi: 10.1088/1674-1056/18/8/002pmid: N/A
This paper researched into some methods for generating min-weighted rigid graphs and min-weighted persistent graphs. Rigidity and persistence are currently used in various studies on coordination and control of autonomous multi-agent formations. To minimize the communication complexity of formations and reduce energy consumption, this paper introduces the rigidity matrix and presents three algorithms for generating min-weighted rigid and min-weighted persistent graphs. First, the existence of a min-weighted rigid graph is proved by using the rigidity matrix, and algorithm 1 is presented to generate the min-weighted rigid graphs. Second, the algorithm 2 based on the rigidity matrix is presented to direct the edges of min-weighted rigid graphs to generate min-weighted persistent graphs. Third, the formations with range constraints are considered, and algorithm 3 is presented to find whether a framework can form a min-weighted persistent formation. Finally, some simulations are given to show the efficiency of our research.
Are networks with more edges easier to synchronize, or not?Zhi-Sheng, Duan; Wen-Xu, Wang; Chao, Liu; Guan-Rong, Chen
doi: 10.1088/1674-1056/18/8/004pmid: N/A
In this paper, the relationship between network synchronizability and the edge-addition of its associated graph is investigated. First, it is shown that adding one edge to a cycle definitely decreases the network synchronizability. Then, since sometimes the synchronizability can be enhanced by changing the network structure, the question of whether the networks with more edges are easier to synchronize is addressed. Based on a subgraph and complementary graph method, it is shown by examples that the answer is negative even if the network structure is arbitrarily optimized. This reveals that generally there are redundant edges in a network, which not only make no contributions to synchronization but actually may reduce the synchronizability. Moreover, a simple example shows that the node betweenness centrality is not always a good indicator for the network synchronizability. Finally, some more examples are presented to illustrate how the network synchronizability varies following the addition of edges, where all the examples show that the network synchronizability globally increases but locally fluctuates as the number of added edges increases.