Abstract
The numerical methods used to model complex geometries required by many scientific applications often favour the use of unstructured meshes and finite element discretisation methods over structured grid alternatives. This flexibility introduces complications, such as the management of mesh quality and additional computational overheads arising from indirect addressing [5]. Using the Finite Element Method for the numerical solution of PDEs, a posteriori error estimations on the PDE solution help evaluate a quality functional [4] and determine the low-quality mesh elements. Mesh adaptivity methods ([3], [1]) provide an important means to control solution error by focusing mesh resolution in regions of the computational domain when and where it is required.
Adaptive algorithms are grouped into two main categories, h-adaptivity and r-adaptivity algorithms. The first category contains techniques which try to adapt the mesh by changing its topology. This can be done by removing existing mesh elements, a technique known as coarsening, increasing local mesh resolution by adding new elements, a procedure called refinement, or replacing a group of elements with a different group, which can be achieved through swapping. The second group of adaptive algorithms encompasses a variety of vertex smoothing techniques, all of which leave mesh topology intact and only attempt to improve quality by relocating mesh vertices. Algorithm 1 demonstrates the general procedure for the solution of a PDE on an adaptive mesh. A problem is said to be anisotropic if its solution exhibits directional dependencies. An anisotropic mesh contains elements which have some suitable orientation. In this case, the error estimation is given in the form of a metric tensor field M(x), i.e. a tensor which, for each point in the domain, represents the desired length and orientation of a mesh edge containing this point. Adapting a mesh so that it distributes the error uniformly over the whole mesh is equivalent to constructing a uniform mesh consisting of equilateral triangles with respect to the non-Euclidean metric M(x).
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
- Element Discretisation Method
- Adaptive Algorithm
- Posteriori Error Estimation
- Mesh Quality
- Anisotropic Mesh
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Freitag, L., Jones, M., Plassmann, P.: An efficient parallel algorithm for mesh smoothing. In: Proceedings of the 4th International Meshing Roundtable, Sandia National Laboratories, pp. 47–58. Citeseer (1995)
Freitag, L.F., Jones, M.T., Plassmann, P.E.: The Scalability Of Mesh Improvement Algorithms. In: IMA Volumes in Mathematics and its Applications, pp. 185–212. Springer (1998)
Li, X., Shephard, M., Beall, M.: 3d anisotropic mesh adaptation by mesh modification. Computer Methods in Applied Mechanics and Engineering 194(48-49), 4915–4950 (2005)
Vasilevskii, Y., Lipnikov, K.: An adaptive algorithm for quasioptimal mesh generation. Computational Mathematics and Mathematical Physics 39(9), 1468–1486 (1999)
Piggott, M.D., Farrell, P.E., Wilson, C.R., Gorman, G.J., Pain, C.C.: Anisotropic mesh adaptivity for multi-scale ocean modelling. Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 367(1907), 4591–4611 (1907)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Rokos, G., Gorman, G. (2013). PRAgMaTIc – Parallel Anisotropic Adaptive Mesh Toolkit. In: Keller, R., Kramer, D., Weiss, JP. (eds) Facing the Multicore-Challenge III. Lecture Notes in Computer Science, vol 7686. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35893-7_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-35893-7_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35892-0
Online ISBN: 978-3-642-35893-7
eBook Packages: Computer ScienceComputer Science (R0)