A Comparative Numerical Study of Meshing Functionals for Variational Mesh Adaptation

We present a comparative numerical study for three functionals used for variational mesh adaptation. One of them is a generalization of Winslow's variable diffusion functional while the others are based on equidistribution and alignment. These functionals are known to have nice theoretical properties and work well for most mesh adaptation problems either as a stand-alone variational method or combined within the moving mesh framework. Their performance is investigated numerically in terms of equidistribution and alignment mesh quality measures. Numerical results in 2D and 3D are presented.     

Model Adaptation Enriched with an Anisotropic Mesh Spacing for Nonlinear Equations: Application to Environmental and CFD Problems

Goal of this paper is to suitably combine a model with an anisotropic mesh adaptation for the numerical simulation of nonlinear advection-diffusion-reaction systems and incompressible flows in ecological and environmental applications. Using the reduced-basis method terminology, the proposed approach leads to a noticeable computational saving of the online phase with respect to the resolution of the reference model on nonadapted grids. The search of a suitable adapted model/mesh pair is to be meant, instead, in an offline fashion.     

可视球面多分辨率网格建模与求解

针对任意视点下的球面多分辨率网格建模与求解困难的情况,提出了屏幕细分自适应算法.该算法将计算限制在与视点相关的可视球面区域,求解得到视点相关的可视球面多分辨率网格,并在PC机上实现了可视球面多分辨率网格的三维表现.     

空间网格上的三次GC′插值格式

本文得到了由三次参数多项式构造的ＧＣ＇插值格式定义在由空间三角形和空间四边形构成的空间网格上，并通过该网格的所有网点，同时在每个网点处以事先给定的平面为切平面．     

三维欧氏Steiner最小树的Delaunay四面体网格混合智能算法

Steiner最小树问题是组合优化中经典的NP难题,在许多实际问题中有着广泛的应用,而三维欧氏Steiner最小树问题是对二维欧氏Steiner最小树问题的推广。由于三维欧氏Steiner树问题的求解非常困难,至今为止的相关成果较为少见。本文针对该问题,利用Delaunay四面体网格剖分技术,提出了一种混合型智能求解方法,不仅可以尽量避免拓扑结构陷入局部最优,且对较大规模的问题求解亦有良好的效果。算法在Matlab环境下编程实现,经实例测试,获得了满意的效果。     

A Hybrid Mesh Selection Strategy Based on Conditioning for Boundary Value ODE Problems

An appropriate mesh selection strategy is one of the fundamental tools in designing robust codes for differential problems, especially if the codes are required to work for difficult multi scale problems. Most of the existing codes base the mesh selection on an estimate of the error (or the residual). Our strategy, based on the estimation of two parameters characterising the conditioning of the continuous problem, as well as on an estimate of the error, not only permits us to obtain a well adapted mesh, thus reducing the cost of the code, but also provides a measure of the conditioning of both continuous and discrete problems.     

Explicit Hybrid Numerical Method for the Allen-Cahn Type Equations on Curved Surfaces

We present a simple and fast explicit hybrid numerical scheme for the motion by mean curvature on curved surfaces in three-dimensional (3D) space. We numerically solve the Allen-Cahn (AC) and conservative Allen-Cahn (CAC) equations on a triangular surface mesh. We use the operator splitting method and an explicit hybrid numerical method. For the AC equation, we solve the diffusion term using a discrete Laplace-Beltrami operator on the triangular surface mesh and solve the reaction term using the closed-form solution, which is obtained using the separation of variables. Next, for the CAC equation, we additionally solve the time-space dependent Lagrange multiplier using an explicit scheme. Our numerical scheme is computationally fast and efficient because we use an explicit hybrid numerical scheme. We perform various numerical experiments to demonstrate the robustness and efficiency of the proposed scheme.     

Stochastic Domain Decomposition for Time Dependent Adaptive Mesh Generation

The efficient generation of meshes is an important component in the numerical solution of problems in physics and engineering. Of interest are situations where global mesh quality and a tight coupling to the solution of the physical partial differential equation (PDE) is important. We consider parabolic PDE mesh generation and present a method for the construction of adaptive meshes in two spatial dimensions using stochastic domain decomposition that is suitable for an implementation in a multi- or many-core environment. Methods for mesh generation on periodic domains are also provided. The mesh generator is coupled to a time dependent physical PDE and the system is evolved using an alternating solution procedure. The method uses the stochastic representation of the exact solution of a parabolic linear mesh generator to find the location of an adaptive mesh along the (artificial) subdomain interfaces. The deterministic evaluation of the mesh over each subdomain can then be obtained completely independently using the probabilistically computed solutions as boundary conditions. A small scaling study is provided to demonstrate the parallel performance of this stochastic domain decomposition approach to mesh generation. We demonstrate the approach numerically and compare the mesh obtained with the corresponding single domain mesh using a representative mesh quality measure.     

Simulating Three-Dimensional Free Surface Viscoelastic Flows using Moving Finite Difference Schemes

An efficient finite difference framework based on moving meshes methods is developed for the three-dimensional free surface viscoelastic flows. The basic model equations are based on the incompressible Navier-Stokes equations and the Oldroyd-B constitutive model for viscoelastic flows is adopted. A logical domain semi-Lagrangian scheme is designed for moving-mesh solution interpolation and convection. Numerical results show that harmonic map based moving mesh methods can achieve better accuracy for viscoelastic flows with free boundaries while using much less memory and computational time compared to the uniform mesh simulations.     

计算机辅助几何设计中极小曲面造型的研究进展

极小曲面在工程领域有着广泛应用,因此将其引入计算机辅助几何设计领域具有重要意义.详细概述了近年来计算机辅助几何设计领域中极小曲面造型的研究工作,按照造型方法的不同,可将现有工作分为精确造型方法和逼近造型方法两类.精确造型方法主要包括两个部分:某些特殊极小曲面的控制网格表示与构造;等温参数多项式极小曲面的挖掘与性质.逼近造型方法主要包括3个部分t基于数值计算的逼近方法;基于线性偏微分方程的逼近方法;基于能量函数最优化的逼近方法.最后对这些方法进行了分析比较,并讨论了极小曲面造型中有待进一步解决的问题.     

Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains

We describe a distributed memory parallel Delaunay refinement algorithm for simple polyhedral domains whose constituent bounding edges and surfaces are separated by angles between 90° to 270° inclusive. With these constraints, our algorithm can generate meshes containing tetrahedra with circumradius to shortest edge ratio less than 2, and can tolerate more than 80% of the communication latency caused by unpredictable and variable remote gather operations.

Our experiments show that the algorithm is efficient in practice, even for certain domains whose boundaries do not conform to the theoretical limits imposed by the algorithm. The algorithm we describe is the first step in the development of much more sophisticated guaranteed-quality parallel mesh generation algorithms.     

A Robin-Robin Domain Decomposition Method for a Stokes-Darcy Structure Interaction with a Locally Modified Mesh

A new numerical method based on locally modified Cartesian meshes is proposed for solving a coupled system of a fluid flow and a porous media flow. The fluid flow is modeled by the Stokes equations while the porous media flow is modeled by Darcy's law. The method is based on a Robin-Robin domain decomposition method with a Cartesian mesh with local modifications near the interface. Some computational examples are presented and discussed.     

Discrete Maximum Principle and a Delaunay-Type Mesh Condition for Linear Finite Element Approximations of Two-Dimensional Anisotropic Diffusion Problems

A Delaunay-type mesh condition is developed for a linear finite element approximation of two-dimensional anisotropic diffusion problems to satisfy a discrete maximum principle.The condition is weaker than the existing anisotropic non-obtuse angle condition and reduces to the well known Delaunay condition for the special case with the identity diffusion matrix.Numerical results are presented to verify the theoretical findings.     

General method for producing a boundary-fitted orthogonal curvilinear mesh

A general method is described for computing an orthogonal mesh fitted to a two-dimensional physical domain with arbitrary closed boundary. The method allows optimum control of mesh spacing through the introduction of arbitrary (with weak constraints) ‘packing’ functions into the elliptic governing equations. Two particular aspects are addressed: first, the condition on a scaling factor which normalizes the mesh aspect ratio; second, the condition for avoiding run-out of the mesh beyond the boundaries of the physical domain.Conversion of the equations to finite difference form and appropriate iterative techniques are discussed. Finally applications of the method in the context of flow across a bundle of rods are presented.     

可压缩平面流中尖角处不定常涡产生的初始阶段的数值模拟

本文采用有限体积法结合高分辨率的ＴＶＤ（总变差不增）格式，对平面激波遇矩形、三角形障碍物问题进行数值模拟，采用Ｓｃｈｗａｒｚ变换生成计算网格，可使网格线在尖角处较密集且网格设置符合流场物理特性。初始阶段的流场复杂且粘性影响的尺度很小，模型中可以忽略流体的粘性。计算结果描述了平面无粘可压流中，由于弓形激波后熵与温度的不均匀性引起的尖角下游不定常集中涡的产生过程。数值计算与应我们要求所做激波管实验的光测结果相符合。     

A dynamic mesh adaptation method for magnetohydrodynamics problems

A dynamic adaptation method is used to numerically solve the MHD equations. The basic idea behind the method is to use an arbitrary nonstationary coordinate system for which the numerical procedure and the mesh refinement mechanism are formulated as a unified differential model. Numerical examples of multidimensional MHD flows on dynamic adaptive meshes are given to illustrate the method.     

Adaptive Reservoir Evolutionary Algorithm: An Evolutionary On-Line Adaptation Scheme for Global Function Optimization

This paper introduces a novel global optimization heuristic algorithm based on the basic paradigms of Evolutionary Algorithms (EA). The algorithm greatly extends a previous strategy proposed by the authors in Munteanu and Lazarescu (1998). In the newly designed algorithm the exploration/exploitation of the search space is adapted on-line based on the current features of the landscape that is being searched. The on-line adaptation mechanism involves a decision process as to whether more exploitation or exploration is needed depending on the current progress of the algorithm and on the current estimated potential of discovering better solutions. The convergence with probability 1 in finite time and discrete space is analyzed, as well as an extensive comparison with other evolutionary optimization heuristics is performed on a set of test functions.     

Bakhvalov-Shishkin网格上求解边界层问题的差分进化算法

该文在Bakhvalov-Shishkin网格上求解具有左边界层或右边界层的对流扩散方程,并采用差分进化算法对Bakhvalov-Shishkin网格中的参数进行优化,获得了该网格上具有最优精度的数值解.对三个算例进行了数值模拟,数值结果表明:采用差分进化算法求解具有较高的计算精度和收敛性,特别是边界层的数值解精度明显...     

非线性双曲型方程的变网格有限元法

对一类非线性双曲型方程给出了两种变网格有限元逼近格式 .在一定条件下 ,得到了最优 H 1模误差估计     

求解全局优化问题的三角进化算法

This paper presents a hybrid heuristic-triangle evolution （TE） for global optimization. It is a real coded evolutionary algorithm. As in differential evolution （DE）, TE targets each individual in current population and attempts to replace it by a new better individual. However, the way of generating new individuals is different. TE generates new individuals in a Nelder- Mead way, while the simplices used in TE is 1 or 2 dimensional. The proposed algorithm is very easy to use and efficient for global optimization problems with continuous variables. Moreover, it requires only one （explicit） control parameter. Numerical results show that the new algorithm is comparable with DE for low dimensional problems but it outperforms DE for high dimensional problems.