Boundary node correction and superconvergence in the FEM

Convergence improvement and superconvergence behaviour, obtained by the simple boundary node correction (BNC) procedure for certain stress-like variables of smoothed FEM solutions, are reported in this paper. The effectiveness of BNC is shown through three examples of steady flow problems, and a posterior error analysis based on the multiple-mesh extrapolation technique has been used for estimating the convergence rates.     

基于改进的质心定位的LSSVR算法的设计

针对无线传感中基于质心算法的节点定位存在误差比较大,算法效率低的缺点,提出了一种基于加权的LSSVR的节点定位算法;首先,对未知节点构建节点序列相关度,采用Kendall的Tau指标来估计未知节点的位置,提高了未知节点的定位精度,其次引入了LSSVR概念,构建改进质心算法的LSSVR定位模型,降低了噪声影响,大幅度提高定位精度;仿真实验表明该算法与基本的LSSVR算法在定位精度上有了明显的提高,在锚节点,未知节点所占比例不断增大的情况下该算法定位精度具有很大的提高,降低了算法的计算复杂度,具有较高的应用价值。     

Quantum Monte Carlo with very large multideterminant wavefunctions

An algorithm to compute efficiently the first two derivatives of (very) large multideterminant wavefunctions for quantum Monte Carlo calculations is presented. The calculation of determinants and their derivatives is performed using the Sherman–Morrison formula for updating the inverse Slater matrix. An improved implementation based on the reduction of the number of column substitutions and on a very efficient implementation of the calculation of the scalar products involved is presented. It is emphasized that multideterminant expansions contain in general a large number of identical spin‐specific determinants: for typical configuration interaction‐type wavefunctions the number of unique spin‐specific determinants ( ) with a non‐negligible weight in the expansion is of order . We show that a careful implementation of the calculation of the N_det ‐dependent contributions can make this step negligible enough so that in practice the algorithm scales as the total number of unique spin‐specific determinants, , over a wide range of total number of determinants (here, N_det up to about one million), thus greatly reducing the total computational cost. Finally, a new truncation scheme for the multideterminant expansion is proposed so that larger expansions can be considered without increasing the computational time. The algorithm is illustrated with all‐electron fixed‐node diffusion Monte Carlo calculations of the total energy of the chlorine atom. Calculations using a trial wavefunction including about 750,000 determinants with a computational increase of ～400 compared to a single‐determinant calculation are shown to be feasible. © 2016 Wiley Periodicals, Inc.     

Structural balance in fully signed networks

Node attributes play an important role in shaping network structures, but are generally ignored in transformations of structural balance. A fully signed network consisting of signs of edges and nodes expresses both properties of relationship and node attributes. In this article, we generalize the definition of structural balance in fully signed networks. We transform the unbalanced fully signed network by not only changing signs of edges but also changing the signs of nodes. We propose a memetic algorithm to transform unbalanced networks at the lowest cost. Experiments show that our algorithm can solve this problem efficiently, and different node attribute assignments may lead to different optimized structures. © 2016 Wiley Periodicals, Inc. Complexity 21: 497–511, 2016     

A shift‐adaptive meshfree method for solving a class of initial‐boundary value problems with moving boundaries in one‐dimensional domain

A new shift‐adaptive meshfree method for solving a class of time‐dependent partial differential equations (PDEs) in a bounded domain (one‐dimensional domain) with moving boundaries and nonhomogeneous boundary conditions is introduced. The radial basis function (RBF) collocation method is combined with the finite difference scheme, because, unlike with Kansa's method, nonlinear PDEs can be converted to a system of linear equations. The grid‐free property of the RBF method is exploited, and a new adaptive algorithm is used to choose the location of the collocation points in the first time step only. In fact, instead of applying the adaptive algorithm on the entire domain of the problem (like with other existing adaptive algorithms), the new adaptive algorithm can be applied only on time steps. Furthermore, because of the radial property of the RBFs, the new adaptive strategy is applied only on the first time step; in the other time steps, the adaptive nodes (obtained in the first time step) are shifted. Thus, only one small system of linear equations must be solved (by LU decomposition method) rather than a large linear or nonlinear system of equations as in Kansa's method (adaptive strategy applied to entire domain), or a large number of small linear systems of equations in the adaptive strategy on each time step. This saves a lot in time and memory usage. Also, Stability analysis is obtained for our scheme, using Von Neumann stability analysis method. Results show that the new method is capable of reducing the number of nodes in the grid without compromising the accuracy of the solution, and the adaptive grading scheme is effective in localizing oscillations due to sharp gradients or discontinuities in the solution. The efficiency and effectiveness of the proposed procedure is examined by adaptively solving two difficult benchmark problems, including a regularized long‐wave equation and a Korteweg‐de Vries problem. © 2016Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 32: 1622–1646, 2016     

Rational Surfaces with Many Nodes

We describe smooth rational projective algebraic surfaces over an algebraically closed field of characteristic different from 2 which contain n b ₂ –2 disjoint smooth rational curves with self-intersection –2, where b ₂ is the second Betti number. In the last section this is applied to the study of minimal complex surfaces of general type with p _g = 0 and K² = 8, 9 which admit an automorphism of order 2.     

一个淋病扩散模型的定性分析

本文利用奇点理论与Ｂｅｎｄｉｘｓｏｎ定理对淋病扩散模型进行了定性分析,给出了可行平衡点附近,特别是高阶平衡点附近轨线的定性结构,研究了可行平衡点的全局渐近稳定性,得到了完整的结果。     

动态区域禁忌匹配策略提高新生换热单元竞争力

在优化换热网络过程中, 有分流节点非结构模型的换热单元会打破初始均匀分布状态向流股上游区域集中, 使得冷热流股入口区域无法生成新的换热单元, 造成结构变异能力下降。本文探究该现象成因及其对进化的影响, 并提出动态区域禁忌匹配策略: 上游区域空节点时允许自由匹配; 当上游区域节点非空时进行上游区间的清空操作, 即将生成节点等效向下游区域进行转移, 从而保障换热单元在上游区域的匹配活力, 增强新生成换热单元在结构进化过程中的竞争力, 促进换热网络结构进化。通过在算例15sp和20sp的应用, 发现该策略能够提升网络结构变异能力。     

利用重要度评价矩阵确定复杂网络关键节点

为了对复杂网络节点重要度进行评估,针对节点删除法、节点收缩法和介数法的不足,通过定义节点效率和节点重要度评价矩阵, 提出了一种利用重要度评价矩阵来确定复杂网络关键节点的方法.该方法综合考虑了节点效率、节点度值和相邻节点的重要度贡献,用节点度值和效率值来表征其对相邻节点的重要度贡献,其优化算法的时间复杂度为O(Rn²). 实验分析表明该方法可行有效,对于大型复杂网络可以获得理想的计算能力.     

利用节点效率评估复杂网络功能鲁棒性

为了克服现有复杂网络鲁棒性研究模型只考虑节点失效的局部影响性和网络拓扑鲁棒性的缺陷, 提出了一种利用节点效率来评估复杂网络功能鲁棒性的方法. 该方法综合考虑节点失效的全局影响性, 利用网络中节点的效率来定义各节点的负载、极限负载和失效模型, 通过打击后网络中最终失效节点的比例来衡量网络的功能鲁棒性, 并给出了其评估优化算法. 实验分析表明该方法对考虑节点负载的复杂网络功能鲁棒性的评定可行有效, 对于大型复杂网络可以获得理想的计算能力.