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.     

Hybrid Surface Mesh Adaptation for Climate Modeling

Solution-driven mesh adaptation is becoming quite popular for spatial error control in the numerical simulation of complex computational physics applications, such as climate modeling. Typically, spatial adaptation is achieved by element subdivision （h adaptation） with a primary goal of resolving the local length scales of interest. A sec- ond, less-popular method of spatial adaptivity is called ＂mesh motion＂ （r adaptation）; the smooth repositioning of mesh node points aimed at resizing existing elements to capture the local length scales. This paper proposes an adaptation method based on a combination of both element subdivision and node point repositioning （rh adaptation）. By combining these two methods using the notion of a mobility function, the proposed approach seeks to increase the flexibility and extensibility of mesh motion algorithms while providing a somewhat smoother transition between refined regions than is pro- duced by element subdivision alone. Further, in an attempt to support the requirements of a very general class of climate simulation applications, the proposed method is designed to accommodate unstructured, polygonal mesh topologies in addition to the most popular mesh types.     

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.     

Modified equation based mesh adaptation algorithm for evolutionary scalar partial differential equations

It is well known that on uniform mesh classical higher order schemes for evolutionary problems yield an oscillatory approximation of the solution containing discontinuity or boundary layers. In this article, an entirely new approach for constructing locally adaptive mesh is given to compute nonoscillatory solution by representative “second” order schemes. This is done using modified equation analysis and a notion of data dependent stability of schemes to identify the solution regions for local mesh adaptation. The proposed algorithm is applied on scalar problems to compute the solution with discontinuity or boundary layer. Presented numerical results show underlying second order schemes approximate discontinuities and boundary layers without spurious oscillations.     

A model to simplify 2D triangle meshes with irregular shapes

We present a 2D triangle mesh simplification model which is able to produce high quality approximations of any original planar mesh, regardless of the shape of the original mesh. This method consists of two phases: a self-organizing algorithm and a triangulation algorithm. The self-organizing algorithm is an unsupervised incremental clustering algorithm which provides us a set of nodes representing the best approximation of the original mesh. The triangulation algorithm reconstructs the simplified mesh from the planar points obtained by the self-organizing training process. Some examples are detailed with the purpose of demonstrating the ability of the model to perform the task of simplifying an original mesh with irregular shape.     

Anisotropic mesh adaptation for numerical solution of boundary value problems

We present an efficient mesh adaptation algorithm that can be successfully applied to numerical solutions of a wide range of 2D problems of physics and engineering described by partial differential equations. We are interested in the numerical solution of a general boundary value problem discretized on triangular grids. We formulate a necessary condition for properties of the triangulation on which the discretization error is below the prescribed tolerance and control this necessary condition by the interpolation error. For a sufficiently smooth function, we recall the strategy how to construct the mesh on which the interpolation error is below the prescribed tolerance. Solving the boundary value problem we apply this strategy to the smoothed approximate solution. The novelty of the method lies in the smoothing procedure that, followed by the anisotropic mesh adaptation (AMA) algorithm, leads to the significant improvement of numerical results. We apply AMA to the numerical solution of an elliptic equation where the exact solution is known and demonstrate practical aspects of the adaptation procedure: how to control the ratio between the longest and the shortest edge of the triangulation and how to control the transition of the coarsest part of the mesh to the finest one if the two length scales of all the triangles are clearly different. An example of the use of AMA for the physically relevant numerical simulation of a geometrically challenging industrial problem (inviscid transonic flow around NACA0012 profile) is presented. © 2004 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2004.     

A mathematical model of a mesh system and its implementation

We define and implement a mathematical model for a general 2-d mesh system, which is arrays of processors with a bounded mesh architecture. As one of the simplest distributed architecture with fixed-connection, the 2-d mesh system has found many applications in computer sciences and engineering, particularly in computer communication.

We use mathematical structures to characterize the mesh system and use C to have implemented an executable version of this model. In this paper, we will present the mathematical model itself, discuss some corresponding implementation issues and compare its behaviors with a simulator which we have been using to observe system behaviors.     

A positive cell vertex Godunov scheme for a Beeler–Reuter based model of cardiac electrical activity

The monodomain model is a widely used model in electrocardiology to simulate the propagation of electrical potential in the myocardium. In this paper, we investigate a positive nonlinear control volume finite element scheme, based on Godunov's flux approximation of the diffusion term, for the monodomain model coupled to a physiological ionic model (the Beeler–Reuter model) and using an anisotropic diffusion tensor. In this scheme, degrees of freedom are assigned to vertices of a primal triangular mesh, as in conforming finite element methods. The diffusion term which involves an anisotropic tensor is discretized on a dual mesh using the diffusion fluxes provided by the conforming finite element reconstruction on the primal mesh and the other terms are discretized by means of an upwind finite volume method on the dual mesh. The scheme ensures the validity of the discrete maximum principle without any restriction on the transmissibility coefficients. By using a compactness argument, we obtain the convergence of the discrete solution and as a consequence, we get the existence of a weak solution of the original model. Finally, we illustrate by numerical simulations that the proposed scheme successfully removes nonphysical oscillations in the propagation of the wavefront and maintains conduction velocity close to physiological values.     

A Regularized Newton-Like Method for Nonlinear PDE

An adaptive regularization strategy for stabilizing Newton-like iterations on a coarse mesh is developed in the context of adaptive finite element methods for nonlinear PDE. Existence, uniqueness and approximation properties are known for finite element solutions of quasilinear problems assuming the initial mesh is fine enough. Here, an adaptive method is started on a coarse mesh where the finite element discretization and quadrature error produce a sequence of approximate problems with indefinite and ill-conditioned Jacobians. The methods of Tikhonov regularization and pseudo-transient continuation are related and used to define a regularized iteration using a positive semidefinite penalty term. The regularization matrix is adapted with the mesh refinements and its scaling is adapted with the iterations to find an approximate sequence of coarse-mesh solutions leading to an efficient approximation of the PDE solution. Local q-linear convergence is shown for the error and the residual in the asymptotic regime and numerical examples of a model problem illustrate distinct phases of the solution process and support the convergence theory.     

A posteriori error control for finite element approximations of elliptic eigenvalue problems

We develop a new approach to a posteriori error estimation for Galerkin finite element approximations of symmetric and nonsymmetric elliptic eigenvalue problems. The idea is to embed the eigenvalue approximation into the general framework of Galerkin methods for nonlinear variational equations. In this context residual-based a posteriori error representations are available with explicitly given remainder terms. The careful evaluation of these error representations for the concrete situation of an eigenvalue problem results in a posteriori error estimates for the approximations of eigenvalues as well as eigenfunctions. These suggest local error indicators that are used in the mesh refinement process.     

Mesh and solver co‐adaptation in finite element methods for anisotropic problems

Mesh generation and algebraic solver are two important aspects of the finite element methodology. In this article, we are concerned with the joint adaptation of the anisotropic triangular mesh and the iterative algebraic solver. Using generic numerical examples pertaining to the accurate and efficient finite element solution of some anisotropic problems, we hereby demonstrate that the processes of geometric mesh adaptation and the algebraic solver construction should be adapted simultaneously. We also propose some techniques applicable to the co‐adaptation of both anisotropic meshes and linear solvers. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2005     

Goal-oriented mesh adaptation for flux-limited approximations to steady hyperbolic problems

The development of adaptive numerical schemes for steady transport equations is addressed. A goal-oriented error estimator is presented and used as a refinement criterion for conforming mesh adaptation. The error in the value of a linear target functional is measured in terms of weighted residuals that depend on the solutions to the primal and dual problems. The Galerkin orthogonality error is taken into account and found to be important whenever flux or slope limiters are activated to enforce monotonicity constraints. The localization of global errors is performed using a natural decomposition of the involved weights into nodal contributions. A nodal generation function is employed in a hierarchical mesh adaptation procedure which makes each refinement step readily reversible. The developed simulation tools are applied to a linear convection problem in two space dimensions.     

Error estimation,adaptivity and data transfer in enriched plasticity continua to analysis of shear band localization

In this paper, an adaptive FE analysis is presented based on error estimation, adaptive mesh refinement and data transfer for enriched plasticity continua in the modelling of strain localization. As the classical continuum models suffer from pathological mesh-dependence in the strain softening models, the governing equations are regularized by adding rotational degrees-of-freedom to the conventional degrees-of-freedom. Adaptive strategy using element elongation is applied to compute the distribution of required element size using the estimated error distribution. Once a new mesh is generated, state variables and history-dependent variables are mapped from the old finite element mesh to the new one. In order to transfer the history-dependent variables from the old to new mesh, the values of internal variables available at Gauss point are first projected at nodes of old mesh, then the values of the old nodes are transferred to the nodes of new mesh and finally, the values at Gauss points of new elements are determined with respect to nodal values of the new mesh. Finally, the efficiency of the proposed model and computational algorithms is demonstrated by several numerical examples.     

A mesh simplification strategy for a spatial regression analysis over the cortical surface of the brain

We present a new mesh simplification technique developed for a statistical analysis of a large data set distributed on a generic complex surface, topologically equivalent to a sphere. In particular, we focus on an application to cortical surface thickness data. The aim of this approach is to produce a simplified mesh which does not distort the original data distribution so that the statistical estimates computed over the new mesh exhibit good inferential properties. To do this, we propose an iterative technique that, for each iteration, contracts the edge of the mesh with the lowest value of a cost function. This cost function takes into account both the geometry of the surface and the distribution of the data on it. After the data are associated with the simplified mesh, they are analyzed via a spatial regression model for non-planar domains. In particular, we resort to a penalized regression method that first conformally maps the simplified cortical surface mesh into a planar region. Then, existing planar spatial smoothing techniques are extended to non-planar domains by suitably including the flattening phase. The effectiveness of the entire process is numerically demonstrated via a simulation study and an application to cortical surface thickness data.     

Numerical approximation of the Smagorinsky model by a two-level method

A two-level method for discretizing the Smagorinsky model for the numerical simulation of turbulent flows is proposed. In the two-level algorithm, the solution to the fully nonlinear coarse mesh problem is utilized in a single-step linear fine mesh problem. When modeling parameters are chosen appropriately, the error in the two-level algorithm is comparable to the error in solving the fully nonlinear problem on the fine mesh. We provide an a priori error estimate for the two-level method, which yields appropriate scalings between the coarse and fine mesh-sizes (H and h, respectively), and the radius of the spatial filter used in the Smagorinsky model (δ). In addition, we provide an algorithm in which a coarse mesh correction is performed to further enhance the accuracy. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Preventing deadlock during anisotropic 2D mesh adaptation in hp-adaptive FEM

The paper presents a grammar for anisotropic two-dimensional mesh adaptation in hp-adaptive Finite Element Method with rectangular elements. Expressing mesh transformations as grammar productions is useful for concurrency analysis thanks to exhibiting the partial causality order (Lamport relationship) between atomic operations. It occurs that a straightforward approach to modeling this process via grammar productions leads to potential deadlock in h-adaptation of the mesh. This fact is shown on a Petri net model of an exemplary adaptation. Therefore auxiliary productions are added to the grammar in order to ensure that any sequence of productions allowed by the grammar does not lead to a deadlock state. The fact that the enhanced grammar is deadlock-free is proven via a corresponding Petri net model. The proof has been performed by means of reachability graph construction and analysis. The paper is concluded with numerical simulations of magnetolluric measurements where the deadlock problem occurred.     

Use of geometry in finite element thermal radiation combined with ray tracing

In heat transfer for space applications, the exchanges of energy by radiation play a significant role. In this paper, we present a method which combines the geometrical definition of the model with a finite element mesh. The geometrical representation is advantageous for the radiative component of the thermal problem while the finite element mesh is more adapted to the conductive part. Our method naturally combines these two representations of the model. The geometrical primitives are decomposed into cells. The finite element mesh is then projected onto these cells. This results in a ray tracing acceleration technique. Moreover, the ray tracing can be performed on the exact geometry, which is necessary if specular reflectors are present in the model. We explain how the geometrical method can be used with a finite element formulation in order to solve thermal situation including conduction and radiation. We illustrate the method with the model of a satellite.     

Adaptive least-squares finite element approximations to transonic-flow problems

This work concerns solutions of compressible potential flow problems based on weighted least-squares finite element approximations. The model problem considered is that of the potential flow past a circular cylinder. To capture the transonic flow region, an adaptive algorithm based on mesh redistribution with local mesh refinement and smoothing is developed for suitably weighted least-squares approximations. Numerical results for the model problem are given for the transonic case with shocks. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Automatic mesh-healing technique for model repair and finite element model generation

It has been accepted by many researchers that modification of a model is often a necessity as a precursor to effective mesh generation. However, editing the geometry directly is often found to be cumbersome, tedious and expensive. In preparing a CAD model for numerical simulation, one of the critical issues involves the rectification of geometrical and topological errors. Though visually insignificant, these errors hinder the creation of a valid finite element model with a good mesh quality. Most current state-of-the-art works have been trying to heal geometric models directly. The novelty of the method proposed in this paper is that the mesh-healing process includes both model repair and mesh generation in one black box. The mesh-healing algorithm essentially simplifies the problems of the imperfect models and allows one to deal with simple polygons rather than complex surface representations. This paper addresses errors such as gaps, overlaps, T-joints and simple holes.     

Preconditioning iterative algorithm for the electromagnetic scattering from a large cavity

A preconditioning iterative algorithm is proposed for solving electromagnetic scattering from an open cavity embedded in an infinite ground plane. In this iterative algorithm, a physical model with a vertically layered medium is employed as a preconditioner of the model of general media. A fast algorithm developed in (SIAM J. Sci. Comput. 2005; 27 :553–574) is applied for solving the model of layered media and classical Krylov subspace methods, restarted GMRES, COCG, and BiCGstab are employed for solving the preconditioned system. Our numerical experiments on cavity models with large numbers of mesh points and large wave numbers show that the algorithm is efficient and the number of iterations is independent of the number of mesh points and dependent upon the wave number. Copyright © 2008 John Wiley & Sons, Ltd.