Graph-Grammar Based Longest-Edge Refinement Algorithm for Three-Dimensional Optimally p Refined Meshes with Tetrahedral Elements

Author(s):  
Albert Mosiałek ◽  
Andrzej Szaflarski ◽  
Rafał Pych ◽  
Marek Kisiel-Dorohinicki ◽  
Maciej Paszyński ◽  
...  
Author(s):  
Krzysztof Podsiadło ◽  
Albert Oliver Serra ◽  
Anna Paszyńska ◽  
Rafael Montenegro ◽  
Ian Henriksen ◽  
...  

AbstractIn this paper, we propose parallel graph-grammar-based algorithm for the longest-edge refinements and the pollution simulations in Lesser Poland area. We introduce graph-grammar productions for Rivara’s longest-edged algorithm for the local refinement of unstructured triangular meshes. We utilize the hyper-graph to represent the computational mesh and the graph-grammar productions to express the longest-edge mesh refinement algorithm. The parallelism in the original Rivara’s longest edge refinement algorithm is obtained by processing different longest edge refinement paths in different three ads. Our graph-grammar-based algorithm allows for additional parallelization within a single longest-edge refinement path. The graph-grammar-based algorithm automatically guarantees the validity and conformity of the generated mesh; it prevents the generation of duplicated nodes and edges, elongated elements with Jacobians converging to zero, and removes all the hanging nodes automatically from the mesh. We test the algorithm on generating a surface mesh based on a topographic data of Lesser Poland area. The graph-grammar productions also generate the layers of prismatic three-dimensional elements on top of the triangular mesh, and they break each prismatic element into three tetrahedral elements. Next, we propose graph-grammar productions generating element matrices and right-hand-side vectors for each tetrahedral element. We utilize the Streamline Upwind Petrov–Galerkin (SUPG) stabilization for the pollution propagation simulations in Lesser Poland area. We use the advection–diffusion-reaction model, the Crank–Nicolson time integration scheme, and the graph-grammar-based interface to the GMRES solver.


2021 ◽  
pp. 1-35
Author(s):  
Chunlin Wu ◽  
Liangliang Zhang ◽  
Huiming Yin

Abstract The paper extends the recent work (JAM, 88, 061002, 2021) of the Eshelby's tensors for polynomial eigenstrains from a two dimensional (2D) to three dimensional (3D) domain, which provides the solution to the elastic field with continuously distributed eigenstrain on a polyhedral inclusion approximated by the Taylor series of polynomials. Similarly, the polynomial eigenstrain is expanded at the centroid of the polyhedral inclusion with uniform, linear and quadratic order terms, which provides tailorable accuracy of the elastic solutions of polyhedral inhomogeneity by using Eshelby's equivalent inclusion method. However, for both 2D and 3D cases, the stress distribution in the inhomogeneity exhibits a certain discrepancy from the finite element results at the neighborhood of the vertices due to the singularity of Eshelby's tensors, which makes it inaccurate to use the Taylor series of polynomials at the centroid to catch the eigenstrain at the vertices. This paper formulates the domain discretization with tetrahedral elements to accurately solve for eigenstrain distribution and predict the stress field. With the eigenstrain determined at each node, the elastic field can be predicted with the closed-form domain integral of Green's function. The parametric analysis shows the performance difference between the polynomial eigenstrain by the Taylor expansion at the centroid and the 𝐶0 continuous eigenstrain by particle discretization. Because the stress singularity is evaluated by the analytical form of the Eshelby's tensor, the elastic analysis is robust, stable and efficient.


Author(s):  
Georgios N. Lygidakis ◽  
Ioannis K. Nikolos

Nowadays, the research in the aerospace scientific field relies strongly on CFD (Computational Fluid Dynamics) algorithms, avoiding (initially at least) a large fraction of the extremely time and money consuming experiments in wind tunnels. In this paper such a recently developed academic CFD code, named Galatea, is presented in brief and validated against a benchmark test case. The prediction of compressible fluid flows is succeeded by the relaxation of the Reynolds Averaged Navier-Stokes (RANS) equations, along with appropriate turbulence models (k-ε, k-ω and SST), employed on three-dimensional unstructured hybrid grids, composed of prismatic, pyramidical and tetrahedral elements. For the discretization of the computational field a node-centered finite-volume method is implemented, while for improved computational performance Galatea incorporates an agglomeration multigrid methodology and a suitable parallelization strategy. The proposed algorithm is evaluated against the Wing-Body (WB) and the Wing-Body-Nacelles-Pylons (WBNP) DLR-F6 aircraft configurations, demonstrating its capability for a good performance in terms of accuracy and geometric flexibility.


2016 ◽  
Vol 208 (3) ◽  
pp. 1359-1372 ◽  
Author(s):  
Yoshiya Usui ◽  
Yasuo Ogawa ◽  
Koki Aizawa ◽  
Wataru Kanda ◽  
Takeshi Hashimoto ◽  
...  

2018 ◽  
Vol 28 (3) ◽  
pp. 569-582 ◽  
Author(s):  
Piotr Gurgul ◽  
Konrad Jopek ◽  
Keshav Pingali ◽  
Anna Paszyńska

Abstract This paper describes application of a hyper-graph grammar system for modeling a three-dimensional adaptive finite element method. The hyper-graph grammar approach allows obtaining a linear computational cost of adaptive mesh transformations and computations performed over refined meshes. The computations are done by a hyper-graph grammar driven algorithm applicable to three-dimensional problems. For the case of typical refinements performed towards a point or an edge, the algorithm yields linear computational cost with respect to the mesh nodes for its sequential execution and logarithmic cost for its parallel execution. Such hyper-graph grammar productions are the mathematical formalism used to describe the computational algorithm implementing the finite element method. Each production indicates the smallest atomic task that can be executed concurrently. The mesh transformations and computations by using the hyper-graph grammar-based approach have been tested in the GALOIS environment. We conclude the paper with some numerical results performed on a shared-memory Linux cluster node, for the case of three-dimensional computational meshes refined towards a point, an edge and a face.


2020 ◽  
Vol 87 (4) ◽  
Author(s):  
Kazem Alidoost ◽  
Meng Feng ◽  
Philippe H. Geubelle ◽  
Daniel A. Tortorelli

Abstract The topological derivative describes the variation of a response functional with respect to infinitesimal changes in topology, such as the introduction of an infinitesimal crack or hole. In this three-dimensional fracture mechanics work, we propose an approximation of the energy release rate field associated with a small surface crack of any boundary location, direction, and orientation combination using the topological derivative. This work builds on the work of Silva et al. (“Energy Release Rate Approximation for Small Surface-Breaking Cracks Using the Topological Derivative,” J. Mech. Phys. Solids 59(5), pp. 925–939), in which the authors proposed an approximation of the energy release rate field which was limited to two-dimensional domains. The proposed method is computationally advantageous because it only requires a single analysis. By contrast, current boundary element and finite element-based methods require an analysis for each crack length-location-direction-orientation combination. Furthermore, the proposed method is evaluated on the non-cracked domain, obviating the need for refined meshes in the crack tip region.


Sign in / Sign up

Export Citation Format

Share Document