首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
Funken  Stefan A.  Schmidt  Anja 《Numerical Algorithms》2021,87(3):1147-1176

Adaptive meshing is a fundamental component of adaptive finite element methods. This includes refining and coarsening meshes locally. In this work, we are concerned with the red-green-blue refinement strategy in two dimensions and its counterpart-coarsening. In general, coarsening algorithms are mostly based on an explicitly given refinement history. In this work, we present a coarsening algorithm on adaptive red-green-blue meshes in two dimensions without explicitly knowing the refinement history. To this end, we examine the local structure of these meshes, find an easy-to-verify criterion to adaptively coarsen red-green-blue meshes, and prove that this criterion generates meshes with the desired properties. We present a MATLAB implementation built on the red-green-blue refinement routine of the ameshref-package (Funken and Schmidt 2018, 2019).

  相似文献   

2.
Simulations in cardiac electrophysiology generally use very fine meshes and small time steps to resolve highly localized wavefronts. This expense motivates the use of mesh adaptivity, which has been demonstrated to reduce the overall computational load. However, even with mesh adaptivity performing such simulations on a single processor is infeasible. Therefore, the adaptivity algorithm must be parallelised. Rather than modifying the sequential adaptive algorithm, the parallel mesh adaptivity method introduced in this paper focuses on dynamic load balancing in response to the local refinement and coarsening of the mesh. In essence, the mesh partition boundary is perturbed away from mesh regions of high relative error, while also balancing the computational load across processes. The parallel scaling of the method when applied to physiologically realistic heart meshes is shown to be good as long as there are enough mesh nodes to distribute over the available parallel processes. It is shown that the new method is dominated by the cost of the sequential adaptive mesh procedure and that the parallel overhead of inter-process data migration represents only a small fraction of the overall cost.  相似文献   

3.
A new algorithm for controlling the quality of multiply-refined tetrahedral meshes is presented in this paper. The basic dynamic mesh adaption procedure allows localized grid refinement and coarsening to efficiently capture aerodynamic flow features in computational fluid dynamics problems; however, repeated application of the procedure may significantly deteriorate the quality of the mesh. Results presented show the effectiveness of this mesh quality algorithm and its potential in the area of helicopter aerodynamics and acoustics.  相似文献   

4.
An efficient and reliable a posteriori error estimate is derived for linear parabolic equations which does not depend on any regularity assumption on the underlying elliptic operator. An adaptive algorithm with variable time-step sizes and space meshes is proposed and studied which, at each time step, delays the mesh coarsening until the final iteration of the adaptive procedure, allowing only mesh and time-step size refinements before. It is proved that at each time step the adaptive algorithm is able to reduce the error indicators (and thus the error) below any given tolerance within a finite number of iteration steps. The key ingredient in the analysis is a new coarsening strategy. Numerical results are presented to show the competitive behavior of the proposed adaptive algorithm.

  相似文献   


5.
Local mesh refinement is one of the key steps in the implementations of adaptive finite element methods. This paper presents a parallel algorithm for distributed memory parallel computers for adaptive local refinement of tetrahedral meshes using bisection. This algorithm is used in PHG, Parallel Hierarchical Grid (http: //lsec. cc. ac. cn/phg/J, a toolbox under active development for parallel adaptive finite element solutions of partial differential equations. The algorithm proposed is characterized by allowing simultaneous refinement of submeshes to arbitrary levels before synchronization between submeshes and without the need of a central coordinator process for managing new vertices. Using the concept of canonical refinement, a simple proof of the independence of the resulting mesh on the mesh partitioning is given, which is useful in better understanding the behaviour of the bisectioning refinement procedure.AMS subject classifications: 65Y05, 65N50  相似文献   

6.
We show that two desirable properties for planar mesh refinement techniques are incompatible. Mesh refinement is a common technique for adaptive error control in generating unstructured planar triangular meshes for piecewise polynomial representations of data. Local refinements are modifications of the mesh that involve a fixed maximum amount of computation, independent of the number of triangles in the mesh. Regular meshes are meshes for which every interior vertex has degree 6. At least for some simple model meshing problems, optimal meshes are known to be regular, hence it would be desirable to have a refinement technique that, if applied to a regular mesh, produced a larger regular mesh. We call such a technique a regular refinement. In this paper, we prove that no refinement technique can be both local and regular. Our results also have implications for non-local refinement techniques such as Delaunay insertion or Rivara's refinement. Received August 1, 1996 / Revised version received February 28, 1997  相似文献   

7.
Picard, Gauss–Seidel, and Jacobi monotone iterative methods are presented and analyzed for the adaptive finite element solution of semiconductor equations in terms of the Slotboom variables. The adaptive meshes are generated by the 1-irregular mesh refinement scheme. Based on these unstructured meshes and a corresponding modification of the Scharfetter–Gummel discretization scheme, it is shown that the resulting finite element stiffness matrix is an M-matrix which together with the Shockley–Read–Hall model for the generation–recombination rate leads to an existence–uniqueness–comparison theorem with simple upper and lower solutions as initial iterates. Numerical results of simulations on a MOSFET device model are given to illustrate the accuracy and efficiency of the adaptive and monotone properties of the present methods.  相似文献   

8.
Soukov  S. A. 《Doklady Mathematics》2020,102(2):409-411
Doklady Mathematics - An adaptive mesh refinement algorithm for simulations of the Navier–Stokes equations on unstructured hybrid meshes is presented. Numerical results for compressible...  相似文献   

9.
We develop a method for adaptive mesh refinement for steady state problems that arise in the numerical solution of Cahn–Hilliard equations with an obstacle free energy. The problem is discretized in time by the backward-Euler method and in space by linear finite elements. The adaptive mesh refinement is performed using residual based a posteriori estimates; the time step is adapted using a heuristic criterion. We describe the space–time adaptive algorithm and present numerical experiments in two and three space dimensions that demonstrate the usefulness of our approach.  相似文献   

10.
Many problems with underlying variational structure involve a coupling of volume with surface effects.A straight-forward approach in a finite element discretiza- tion is to make use of the surface triangulation that is naturally induced by the volume triangulation.In an adaptive method one wants to facilitate"matching"local mesh modifications,i.e.,local refinement and/or coarsening,of volume and surface mesh with standard tools such that the surface grid is always induced by the volume grid. We describe the concepts behind this approach for bisectional refinement and describe new tools incorporated in the finite element toolbox ALBERTA.We also present several important applications of the mesh coupling.  相似文献   

11.
We consider a new adaptive finite element (AFEM) algorithm for self‐adjoint elliptic PDE eigenvalue problems. In contrast to other approaches we incorporate the inexact solutions of the resulting finite‐dimensional algebraic eigenvalue problems into the adaptation process. In this way we can balance the costs of the adaptive refinement of the mesh with the costs for the iterative eigenvalue method. We present error estimates that incorporate the discretization errors, approximation errors in the eigenvalue solver and roundoff errors, and use these for the adaptation process. We show that it is also possible to restrict to very few iterations of a Krylov subspace solver for the eigenvalue problem on coarse meshes. Several examples are presented to show that this new approach achieves much better complexity than the previous AFEM approaches which assume that the algebraic eigenvalue problem is solved to full accuracy. Copyright © 2010 John Wiley & Sons, Ltd.  相似文献   

12.
A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation   总被引:1,自引:0,他引:1  
We present a simple new algorithm for triangulating polygons and planar straightline graphs, It provides "shape" and "size" guarantees:
• All triangles have a bounded aspect ratio.
• The number of triangles is within a constant factor of optimal.
Such "quality" triangulations are desirable as meshes for the finite element method, in which the running time generally increases with the number of triangles, and where the convergence and stability may be hurt by very skinny triangles. The technique we use-successive refinement of a Delaunay triangulation-extends a mesh generation technique of Chew by allowing triangles of varying sizes. Compared with previous quadtree-based algorithms for quality mesh generation, the Delaunay refinement approach is much simpler and generally produces meshes with fewer triangles. We also discuss an implementation of the algorithm and evaluate its performance on a variety of inputs.  相似文献   

13.
Directional, anisotropic features like layers in the solution of partial differential equations can be resolved favorably by using anisotropic finite element meshes. An adaptive algorithm for such meshes includes the ingredients Error estimation and Information extraction/Mesh refinement. Related articles on a posteriori error estimation on anisotropic meshes revealed that reliable error estimation requires an anisotropic mesh that is aligned with the anisotropic solution. To obtain anisotropic meshes the so‐called Hessian strategy is used, which provides information such as the stretching direction and stretching ratio of the anisotropic elements. This article combines the analysis of anisotropic information extraction/mesh refinement and error estimation (for several estimators). It shows that the Hessian strategy leads to well‐aligned anisotropic meshes and, consequently, reliable error estimation. The underlying heuristic assumptions are given in a stringent yet general form. Numerical examples strengthen the exposition. Hence the analysis provides further insight into a particular aspect of anisotropic error estimation. © 2002 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 18: 625–648, 2002; DOI 10.1002/num.10023  相似文献   

14.
Quality surface meshes for molecular models are desirable in the studies of protein shapes and functionalities. However, there is still no robust software that is capable to generate such meshes with good quality. In this paper, we present a Delaunay-based surface triangulation algorithm generating quality surface meshes for the molecular skin model. We expand the restricted union of balls along the surface and generate an ε-sampling of the skin surface incrementally. At the same time, a quality surface mesh is extracted from the Delaunay triangulation of the sample points. The algorithm supports robust and efficient implementation and guarantees the mesh quality and topology as well. Our results facilitate molecular visualization and have made a contribution towards generating quality volumetric tetrahedral meshes for the macromolecules.  相似文献   

15.
In this work, we discuss an extension of the adaptive technique in Zhu and Qiu (J. Comput. Phys. 228, 6957-6976 2009) to design an h-adaptive Runge-Kutta discontinuous Galerkin (RKDG) method for the simulations of several classical one-dimensional detonation waves. The TVB troubled-cell indicator is employed to detect the troubled cells which are believed to contain the discontinuities. An adaptive mesh is generated at each time-level by refining the troubled cells and coarsening the others. A recursive multi-level mesh refinement technique is designed to avoid the problem that the detonation front moves so fast that there are not enough cells to resolve the detonation front before it leaves. We describe the numerical implementation in detail including the adaptive procedure, solution reconstruction method and troubled-cell indicator. Furthermore, a high order positivity-preserving technique is employed for the robustness of our algorithm. Extensive numerical tests are conducted to show the effectiveness of the adaptive strategy and advantages of our adaptive method over the fixed-mesh RKDG method in saving the computational storage and improving the solution quality.  相似文献   

16.
This paper addresses fully space-time adaptive magnetic field computations. We describe an adaptive Whitney finite element method for solving the magnetoquasistatic formulation of Maxwell's equations on unstructured 3D tetrahedral grids. Spatial mesh re- finement and coarsening are based on hierarchical error estimators especially designed for combining tetrahedral H(curl)-conforming edge elements in space with linearly implicit Rosenbrock methods in time. An embedding technique is applied to get efficiency in time through variable time steps. Finally, we present numerical results for the magnetic recording write head benchmark problem proposed by the Storage Research Consortium in Japan.  相似文献   

17.
This paper discusses adaptive finite element methods for the solution of elliptic eigenvalue problems associated with partial differential operators. An adaptive method based on nodal-patch refinement leads to an asymptotic error reduction property for the computed sequence of simple eigenvalues and eigenfunctions. This justifies the use of the proven saturation property for a class of reliable and efficient hierarchical a posteriori error estimators. Numerical experiments confirm that the saturation property is present even for very coarse meshes for many examples; in other cases the smallness assumption on the initial mesh may be severe.  相似文献   

18.
We show that the standard assumption on the smallness of the marking parameter θ in adaptive finite element methods can be avoided for the proof of the optimality of the algorithm. To this end we propose a new technique based on comparison of the solutions of different finite element spaces obtained by different refinements of a given mesh. We consider conforming and nonconforming low-order finite elements on triangular and tetrahedral meshes.  相似文献   

19.
Collocation with quadratic C 1-splines for a singularly perturbed reaction-diffusion problem in one dimension is studied. A modified Shishkin mesh is used to resolve the layers. The resulting method is shown to be almost second order accurate in the maximum norm, uniformly in the perturbation parameter. Furthermore, a posteriori error bounds are derived for the collocation method on arbitrary meshes. These bounds are used to drive an adaptive mesh moving algorithm. Numerical results are presented.  相似文献   

20.
** Email: vjervin{at}clemson.edu*** Email: norbert.heuer{at}brunel.ac.uk We present an adaptive refinement strategy for the h-versionof the boundary element method with weakly singular operatorson surfaces. The model problem deals with the exterior Stokesproblem, and thus considers vector functions. Our error indicatorsare computed by local projections onto 1D subspaces definedby mesh refinement. These indicators measure the error separatelyfor the vector components and allow for component-independentadaption. Assuming a saturation condition, the indicators giverise to an efficient and reliable error estimator. Also we describehow to deal with meshes containing quadrilaterals which arenot shape regular. The theoretical results are underlined bynumerical experiments. To justify the saturation assumption,in the Appendix we prove optimal lower a priori error estimatesfor edge singularities on uniform and graded meshes.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号