Anisotropic mesh adaption by metric‐driven optimization

We describe a Gauss–Seidel algorithm for optimizing a three‐dimensional unstructured grid so as to conform to a given metric. The objective function for the optimization process is based on the maximum value of an elemental residual measuring the distance of any simplex in the grid to the local target metric. We analyse different possible choices for the objective function, and we highlight their relative merits and deficiencies. Alternative strategies for conducting the optimization are compared and contrasted in terms of resulting grid quality and computational costs. Numerical simulations are used for demonstrating the features of the proposed methodology, and for studying some of its characteristics. Copyright © 2004 John Wiley & Sons, Ltd.     

A review of error estimation and adaptivity in the boundary element method

When using the boundary element method, the accuracy of the numerical solution depends critically on the discretization of the boundary into elements (panels). The distribution of the panels is one of the most important decisions taken when analyzing a problem, but still the vast majority of users employ empirical guidelines to distribute the panels. This paper reviews the various adaptive schemes that have been proposed for boundary elements. Numerical results are obtained for infinite fluid flow problems and free surface problems and are used to assess the reliability and effectiveness of each method.     

New approaches for error estimation and adaptivity for 2D potential boundary element methods

This work presents two new error estimation approaches for the BEM applied to 2D potential problems. The first approach involves a local error estimator based on a gradient recovery procedure in which the error function is generated from differences between smoothed and non‐smoothed rates of change of boundary variables in the local tangential direction. The second approach involves the external problem formulation and gives both local and global measures of error, depending on a choice of the external evaluation point. These approaches are post‐processing procedures. Both estimators show consistency with mesh refinement and give similar qualitative results. The error estimator using the gradient recovery approach is more general, as this formulation does not rely on an ‘optimal’ choice of an external parameter. This work presents also the use of a local error estimator in an adaptive mesh refinement procedure. This r‐refinement approach is based on the minimization of the standard deviation of the local error estimate. A non‐linear programming procedure using a feasible‐point method is employed using Lagrange multipliers and a set of active constraints. The optimization procedure produces finer meshes close to a singularity and results that are consistent with the problem physics. Copyright © 2002 John Wiley & Sons, Ltd.     

Maximizing learning without sacrificing the fun: Stealth assessment,adaptivity and learning supports in educational games

In this study, we investigated the validity of a stealth assessment of physics understanding in an educational game, as well as the effectiveness of different game-level delivery methods and various in-game supports on learning. Using a game called Physics Playground, we randomly assigned 263 ninth- to eleventh-grade students into four groups: adaptive, linear, free choice and no-treatment control. Each condition had access to the same in-game learning supports during gameplay. Results showed that: (a) the stealth assessment estimates of physics understanding were valid—significantly correlating with the external physics test scores; (b) there was no significant effect of game-level delivery method on students' learning; and (c) physics animations were the most effective (among eight supports tested) in predicting both learning outcome and in-game performance (e.g. number of game levels solved). We included student enjoyment, gender and ethnicity in our analyses as moderators to further investigate the research questions.     

Dynamic flow‐based particle splitting in smoothed particle hydrodynamics

In this work, a dynamic procedure for local particle refinement to be used in smoothed particle hydrodynamics (SPH) is presented. The algorithm is able to consistently produce successive levels of particle splitting in accordance to a flow‐based criterion. It has been applied together with accurate and robust formulations for variable spatial resolution in the framework of a semi‐implicit, truly incompressible scheme for SPH. Different test cases have been considered to assess the capabilities and advantages of the proposed procedure, namely, the laminar flow around circular and square obstacles in a plane channel for various regimes. Such flow cases entail the simulation of attached and separated shear layers, recirculating flow, vortex shedding and surface discontinuities. The results obtained for two levels of particle splitting have demonstrated that significant improvements may be obtained with respect to uniform particle spacing solutions in a variety of situations, thus presenting an excellent trade‐off between accuracy and computational cost. Copyright © 2015 John Wiley & Sons, Ltd.     

A parallel direct solver for the self-adaptive hp Finite Element Method

In this paper we present a new parallel multi-frontal direct solver, dedicated for the hp Finite Element Method (hp-FEM). The self-adaptive hp-FEM generates in a fully automatic mode, a sequence of hp-meshes delivering exponential convergence of the error with respect to the number of degrees of freedom (d.o.f.) as well as the CPU time, by performing a sequence of hp refinements starting from an arbitrary initial mesh. The solver constructs an initial elimination tree for an arbitrary initial mesh, and expands the elimination tree each time the mesh is refined. This allows us to keep track of the order of elimination for the solver. The solver also minimizes the memory usage, by de-allocating partial LU factorizations computed during the elimination stage of the solver, and recomputes them for the backward substitution stage, by utilizing only about 10% of the computational time necessary for the original computations. The solver has been tested on 3D Direct Current (DC) borehole resistivity measurement simulations problems. We measure the execution time and memory usage of the solver over a large regular mesh with 1.5 million degrees of freedom as well as on the highly non-regular mesh, generated by the self-adaptive hp$hp$-FEM, with finite elements of various sizes and polynomial orders of approximation varying from p=1$p=1$ to p=9$p=9$. From the presented experiments it follows that the parallel solver scales well up to the maximum number of utilized processors. The limit for the solver scalability is the maximum sequential part of the algorithm: the computations of the partial LU factorizations over the longest path, coming from the root of the elimination tree down to the deepest leaf.     

面向普适计算的自适应模糊访问控制方法

普适环境中的上下文信息是普适访问控制的关键因素,对主体的授权和对主体使用权限过程的控制具有决定性影响。系统安全强度和安全策略应随上下文的变化而动态改变。传统访问控制模型均未考虑上下文对安全强度和安全策略的动态影响,不适合普适计算环境。提出了普适环境下安全强度和安全策略随上下文动态变化的思想,基于区间值模糊集合理论建立了上下文信息相关的产生式规则,设计了一种简单高效的区间值模糊访问控制方法,以提高普适计算系统中安全强度和安全策略的自适应性,更符合普适环境。     

规则自适应模糊控制器*

本文研究了模糊控制器的控制规则自适应问题，提出了一种新的模糊控制规则自生成与自校正方法及相应的算法。仿真研究结果表明本文提出的控制规则自适应算法是有效的。     

On error estimator and p‐adaptivity in the generalized finite element method

This paper addresses the issue of a p‐adaptive version of the generalized finite element method (GFEM). The technique adopted here is the equilibrated element residual method, but presented under the GFEM approach, i.e., by taking into account the typical nodal enrichment scheme of the method. Such scheme consists of multiplying the partition of unity functions by a set of enrichment functions. These functions, in the case of the element residual method are monomials, and can be used to build the polynomial space, one degree higher than the one of the solution, in which the error functions is approximated. Global and local measures are defined and used as error estimator and indicators, respectively. The error indicators, calculated on the element patches that surrounds each node, are used to control a refinement procedure. Numerical examples in plane elasticity are presented, outlining in particular the effectivity index of the error estimator proposed. Finally, the ‐adaptive procedure is described and its good performance is illustrated by the last numerical example. Copyright © 2004 John Wiley & Sons, Ltd.