Parallel multigrid method for finite element simulations of complex flow problems on locally refined meshes

We present a parallel multigrid solver on locally refined meshes for solving very complex three‐dimensional flow problems. Besides describing the parallel implementation in detail, we prove the smoothing property of the suggested iteration for a simple model problem. For demonstration of the efficiency and feasibility of the solver, we show a chemically reactive flow simulation for a Methane burner using detailed chemical reaction modeling. Further, we give the results of an ocean flow simulation. All described methods are implemented in the finite element toolbox Gascoigne. Copyright © 2010 John Wiley & Sons, Ltd.     

软件可靠性模型和估计

本文根据何国伟提出的软件可靠性模型,特别是输入空间和输入分布的概念,分析软件测试数据特征,给出软件可靠性的点估计和置信下界的计算公式。     

Scheduling two agents with controllable processing times

We consider several two-agent scheduling problems with controllable job processing times, where agents A and B have to share either a single machine or two identical machines in parallel while processing their jobs. The processing times of the jobs of agent A are compressible at additional cost. The objective function for agent B is always the same, namely a regular function _fmax$f_{\text{max}}$. Several different objective functions are considered for agent A, including the total completion time plus compression cost, the maximum tardiness plus compression cost, the maximum lateness plus compression cost and the total compression cost subject to deadline constraints (the imprecise computation model). All problems are to minimize the objective function of agent A subject to a given upper bound on the objective function of agent B. These problems have various applications in computer systems as well as in operations management. We provide NP-hardness proofs for the more general problems and polynomial-time algorithms for several special cases of the problems.     

A flexible framework for Group Decision Support: WINGDSS version 3.0

A flexible framework for Group Decision Support on PCs in Microsoft Windows environment is presented. WINGDSS does not replace human judgment but highly supports the entire process of decision making, from problem structuring to post-decision analysis. The latest version of WINGDSS is a modular, open system with a dynamical connection to relational databases, an interpreter for defining problem specific evaluation procedures, a lot of interactive features from setting up the tree of criteria until the sensitivity analysis on individual/group ranking. By providing tools for recursively redefining the decision problem, WINGDSS helps the decision makers in achieving a result satisfactory to the whole group.Research supported in part by the Hungarian Foundation for Scientific Research, Grant No. 2568 and by the Hungarian National Committee for Technical Research and Development, Grant No. 93-97-67-0553.     

Multilevel Monte Carlo in approximate Bayesian computation

In the following article, we consider approximate Bayesian computation (ABC) inference. We introduce a method for numerically approximating ABC posteriors using the multilevel Monte Carlo (MLMC). A sequential Monte Carlo version of the approach is developed and it is shown under some assumptions that for a given level of mean square error, this method for ABC has a lower cost than i.i.d. sampling from the most accurate ABC approximation. Several numerical examples are given.     

A self-adaptive differential evolution algorithm based on ant system with application to estimate kinetic parameters

A self-adaptive differential evolution (DE) algorithm, in which an ant system is used to implement the self-adaptation of mutation and crossover control parameters, called ant system self-adaptive differential evolution (ASSDE), is proposed. First, the spaces of the mutation and crossover control parameters are divided into several regions and all regions are given the same initial intensity of pheromone trails. The probability of selecting parameter regions for each individual is influenced by the intensity of the region pheromone trails and its visibility. An individual will reinforce the trail of the selected regions with its own pheromone, when the offspring is better than its parent. The experiment results show that the ASSDE clearly outperforms the original DE algorithm and other existing self-adaptive DE algorithms for 16 benchmark functions. Furthermore, ASSDE is applied to develop the global kinetic model for hydropurification of terephthalic acid (HPTA), and satisfactory results are obtained.     

基于CorelDRAW与Origin联合应用的制图方法研究

实验结果的图形表达是现代科技交流的主要手段之一. 为使所绘制图形能符合科技期刊规范化出版要求, 探讨了联合应用CorelDRAW和Origin的制图方法. 根据相关图形的特点, 运用Origin软件的数据处理和图形输出功能, 结合CorelDRAW软件的矢量化特点以及某些特性功能, 方便快捷地绘制出符合规范的期刊插图, 并通过实例证明了这是一种简易的制图方法, 可有效地提高期刊的出版质量和效率.     

基于ANSYS Workbench热板电加热与油加热模拟及对比分析

为改善平板硫化机热板表面温度场分布的均匀性, 对规格为75mm×2400mm×2400mm的平板硫化机热板进行了有限元模拟. 利用ANSYS Workbench软件分别模拟热板电加热与导热油加热情况, 并进行对比分析. 结果表明, 针对同一块热板在加热到190℃工作温度左右时, 电加热热板表面温差为12.012℃, 导热油加热热板表面温差为9.2℃. 模拟分析结果表明, 采用导热油加热热板表面温度均匀性更高、升温速率更快; 且入口流速在4m?s-1时, 温度场均匀性得到明显改善.     

零误差计算

研究采用有误差的数值计算来获得无误差的准确值具有重要的理论价值和应用价值.这种通过近似的数值方法获得准确结果的计算被称为零误差计算.本文首先指出,只有一致离散集合中的数才能够开展零误差计算,即有非零隔离界的数集,这也是数可以进行零误差计算的一个充要条件.以此为基本出发点,本文分析代数数零误差计算的最低理论精度,该精度对应于恢复近似代数数的准确值时必要的误差控制条件,但由于所采用恢复算法的局限性,这一理论精度往往不能保证成功恢复出代数数的准确值.为此,本文给出采用PSLQ (partial-sum-LQ-decomposition)算法进行代数数零误差计算所需的精度控制条件,与基于LLL (Lenstra-Lenstra-Lovász)算法相比,该精度控制条件关于代数数次数的依赖程度由二次降为拟线性,从而可降低相应算法的复杂度.最后探讨零误差计算未来的发展趋势.     

Numerical algorithms for uniform Airy-type asymptotic expansions

Airy-type asymptotic representations of a class of special functions are considered from a numerical point of view. It is well known that the evaluation of the coefficients of the asymptotic series near the transition point is a difficult problem. We discuss two methods for computing the asymptotic series. One method is based on expanding the coefficients of the asymptotic series in Maclaurin series. In the second method we consider auxiliary functions that can be computed more efficiently than the coefficients in the first method, and we do not need the tabulation of many coefficients. The methods are quite general, but the paper concentrates on Bessel functions, in particular on the differential equation of the Bessel functions, which has a turning point character when order and argument of the Bessel functions are equal.