双向粘弹性节理岩体时域等效分析

以双向粘弹性节理岩体为研究对象,基于一种简单等效假定和自适应算法,并结合有限元方法,得到递推格式的等效本构模型和等效粘弹性场计算模型.通过算例,将等效解与基于ANSYS的非均质解进行比较.从计算精度和效率平衡的角度而言,等效模型的结果是令人满意的.     

Adaptive Runge–Kutta discontinuous Galerkin method for complex geometry problems on Cartesian grid

A Cartesian grid method using immersed boundary technique to simulate the impact of body in fluid has become an important research topic in computational fluid dynamics because of its simplification, automation of grid generation, and accuracy of results. In the frame of Cartesian grid, one often uses finite volume method with second order accuracy or finite difference method. In this paper, an h‐adaptive Runge–Kutta discontinuous Galerkin (RKDG) method on Cartesian grid with ghost cell immersed boundary method for arbitrarily complex geometries is developed. A ghost cell immersed boundary treatment with the modification of normal velocity is presented. The method is validated versus well documented test problems involving both steady and unsteady compressible flows through complex bodies over a wide range of Mach numbers. The numerical results show that the present boundary treatment to some extent reduces the error of entropy and demonstrate the efficiency, robustness, and versatility of the proposed approach. Copyright © 2013 John Wiley & Sons, Ltd.     

Spatially adaptive sparse grids for high-dimensional data-driven problems

Sparse grids allow one to employ grid-based discretization methods in data-driven problems. We present an extension of the classical sparse grid approach that allows us to tackle high-dimensional problems by spatially adaptive refinement, modified ansatz functions, and efficient regularization techniques. The competitiveness of this method is shown for typical benchmark problems with up to 166 dimensions for classification in data mining, pointing out properties of sparse grids in this context. To gain insight into the adaptive refinement and to examine the scope for further improvements, the approximation of non-smooth indicator functions with adaptive sparse grids has been studied as a model problem. As an example for an improved adaptive grid refinement, we present results for an edge-detection strategy.     

带有Bernoulli反馈的多级适应性休假的Geo/G/1排队系统分析

考虑带有Bernoulli反馈的多级适应性休假的Geo/G/1离散时间排队系统.通过引入服务员忙期和使用一种简洁的分解方法,讨论了队长的瞬时分布,得到了在任意时刻n队长为j的概率关于时刻n的z-变换的递推式,及队长平稳分布的递推式,且证明了稳态队长的随机分解性质.最后,给出了在特殊情形下相应的一些结果和数值计算实例.     

Boundary element method for calculation of effective elastic moduli in 3D linear elasticity

A boundary integral formulation of the linear elasticity problem for a multi‐component composite is given. The fast BEM solver based on the adaptive cross approximation is then obtained by the data‐sparse representation of the resulting Galerkin matrices. The solver is used to obtain effective elastic moduli of fibre and particle reinforced composites in three dimensions by means of the strain energy equivalence principle. Copyright © 2009 John Wiley & Sons, Ltd.     

THE COMPACTION OF TIME-DEPENDENT VISCOUS GRANULAR MATERIALS CONSIDERING INERTIAL FORCES

In the present paper, compactions of time-dependent viscous granular materials are simulated step by step using the automatic adaptive mesh generation schemes. Inertial forces of the viscous incompressible aggregates are taken into account. The corresponding conservation equations, the weighted-integral formulations, and penalty finite element model are investigated. The fully discrete finite element equations for the simulation are derived. Polygonal particles of aggregates are simplified as mixed three-node and four-node elements. The automatic adaptive mesh generation schemes include contact detection algorithms, and mesh upgrade schemes. Solutions of the numerical simulation are in good agreement with some results from literatures. With minor modification, the proposed numerical model can be applied in several industries, including the pharmaceutical, ceramic, food, and household product manufacturing.     

Evolutionary dynamics in a Lotka–Volterra competition model with impulsive periodic disturbance

In this paper, we develop a theoretical framework to investigate the influence of impulsive periodic disturbance on the evolutionary dynamics of a continuous trait, such as body size, in a general Lotka–Volterra‐type competition model. The model is formulated as a system of impulsive differential equations. First, we derive analytically the fitness function of a mutant invading the resident populations when rare in both monomorphic and dimorphic populations. Second, we apply the fitness function to a specific system of asymmetric competition under size‐selective harvesting and investigate the conditions for evolutionarily stable strategy and evolutionary branching by means of critical function analysis. Finally, we perform long‐term simulation of evolutionary dynamics to demonstrate the emergence of high‐level polymorphism. Our analytical results show that large harvesting effort or small impulsive harvesting period inhibits branching, while large impulsive harvesting period promotes branching. Copyright © 2015 John Wiley & Sons, Ltd.     

Convergence of goal‐oriented adaptive finite element methods for nonsymmetric problems

In this article, we develop convergence theory for a class of goal‐oriented adaptive finite element algorithms for second‐order nonsymmetric linear elliptic equations. In particular, we establish contraction results for a method of this type for Dirichlet problems involving the elliptic operator with A Lipschitz, symmetric positive definite, with b divergence‐free, and with . We first describe the problem class and review some standard facts concerning conforming finite element discretization and error‐estimate‐driven adaptive finite element methods (AFEM). We then describe a goal‐oriented variation of standard AFEM. Following the recent work of Mommer and Stevenson for symmetric problems, we establish contraction and convergence of the goal‐oriented method in the sense of the goal function. Our analysis approach is signficantly different from that of Mommer and Stevenson, combining the recent contraction frameworks developed by Cascon, Kreuzer, Nochetto, and Siebert; by Nochetto, Siebert, and Veeser; and by Holst, Tsogtgerel, and Zhu. We include numerical results, demonstrating performance of our method with standard goal‐oriented strategies on a convection problem. © 2015 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 32: 479–509, 2016     

A greedy meshless local Petrov–Galerkin methodbased on radial basis functions

The meshless local Petrov–Galerkin (MLPG) method with global radial basis functions (RBF) as trial approximation leads to a full final linear system and a large condition number. This makes MLPG less efficient when the number of data points is increased. We can overcome this drawback if we avoid using more points from the data site than absolutely necessary. In this article, we equip the MLPG method with the greedy sparse approximation technique of (Schaback, Numercail Algorithms 67 (2014), 531–547) and use it for numerical solution of partial differential equations. This scheme uses as few neighbor nodal values as possible and allows to control the consistency error by explicit calculation. Whatever the given RBF is, the final system is sparse and the algorithm is well‐conditioned. © 2015 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 32: 847–861, 2016     

Adaptive impulsive synchronization of uncertain delayed chaotic system with full unknown parameters via discrete‐time drive signals

This article investigates the adaptive impulsive synchronization of delayed chaotic system with full unknown parameters. Aiming at this problem, we propose a new adaptive strategy, in which both the adaptive–impulsive controller and the parameters adaptive laws are designed via the discrete‐time signals from the drive system. The corresponding theoretical proof is given to guarantee the effectiveness of the proposed strategy. Moreover, the concrete adaptive strategies are achieved for delayed Hopfield neural network, optical Ikeda system and the well‐known delayed Lü chaotic system. As expected, numerical simulations show the effectiveness of the proposed strategy. This method has potential applications in parameters estimation, secure communication, and cryptanalysis when only discrete signals are transmitted in communication channel. © 2014 Wiley Periodicals, Inc. Complexity 21: 43–51, 2016