arXiv subjects

Alejandro Ortiz-Bernardin

Publications and source records attributed to Alejandro Ortiz-Bernardin.

5 recordsLinked to original sources

arXiv2024

A node-based uniform strain virtual element method for elastoplastic solids

A recently proposed node-based uniform strain virtual element method (NVEM) is here extended to small strain elastoplastic solids. In the proposed method, the strain is averaged at the nodes from the strain of surrounding linearly precise virtual elements using a generalization to virtual elements of the node-based uniform strain approach for finite elements. The averaged strain is then used to sample the weak form at the nodes of the mesh leading to a method in which all the field variables, including state and history-dependent variables, are related to the nodes and thus they are tracked only at these locations during the nonlinear computations. Through various elastoplastic benchmark problems, we demonstrate that the NVEM is locking-free while enabling linearly precise virtual elements to solve elastoplastic solids with accuracy.

math.NA↗

arXiv2022

GPU Parallel algorithm for the generation of polygonal meshes based on terminal-edge regions

This paper presents a GPU parallel algorithm to generate a new kind of polygonal meshes obtained from Delaunay triangulations. To generate the polygonal mesh, the algorithm first uses a classification system to label each edge of an input triangulation; second it builds polygons (simple or not) from terminal-edge regions using the label system, and third it transforms each non-simple polygon from the previous phase into simple ones, convex or not convex polygons. We show some preliminary experiments to test the scalability of the algorithm and compare it with the sequential version. We also run a very simple test to show that these meshes can be useful for the virtual element method.

cs.DC↗

arXiv2022

POLYLLA: Polygonal meshing algorithm based on terminal-edge regions

This paper presents an algorithm to generate a new kind of polygonal mesh obtained from triangulations. Each polygon is built from a terminal-edge region surrounded by edges that are not the longest-edge of any of the two triangles that share them. The algorithm is termed Polylla and is divided into three phases. The first phase consists of labeling each edge of the input triangulation according to its size; the second phase builds polygons (simple or not) from terminal-edges regions using the label system; and the third phase transforms each non simple polygon into simple ones. The final mesh contains polygons with convex and non convex shape. Since Voronoi based meshes are currently the most used polygonal meshes, we compare some geometric properties of our meshes against constrained Voronoi meshes. Several experiments were run to compare the shape and size of polygons, the number of final mesh points and polygons. For the same input, Polylla meshes contain less polygons than Voronoi meshes, and the algorithm is simpler and faster than the algorithm to generate constrained Voronoi meshes. Finally, we have validated Polylla meshes by solving the Laplace equation on an L-shaped domain using the Virtual Element Method (VEM). We show that the numerical performance of the VEM using Polylla meshes and Voronoi meshes is similar.

cs.CG↗

arXiv2018

Veamy: an extensible object-oriented C++ library for the virtual element method

This paper summarizes the development of Veamy, an object-oriented C++ library for the virtual element method (VEM) on general polygonal meshes, whose modular design is focused on its extensibility. The linear elastostatic and Poisson problems in two dimensions have been chosen as the starting stage for the development of this library. The theory of the VEM, upon which Veamy is built, is presented using a notation and a terminology that resemble the language of the finite element method (FEM) in engineering analysis. Several examples are provided to demonstrate the usage of Veamy, and in particular, one of them features the interaction between Veamy and the polygonal mesh generator PolyMesher. A computational performance comparison between VEM and FEM is also conducted. Veamy is free and open source software.

cs.MS↗

arXiv2018

A volume-averaged nodal projection method for the Reissner-Mindlin plate model

We introduce a novel meshfree Galerkin method for the solution of Reissner-Mindlin plate problems that is written in terms of the primitive variables only (i.e., rotations and transverse displacement) and is devoid of shear-locking. The proposed approach uses linear maximum-entropy approximations and is built variationally on a two-field potential energy functional wherein the shear strain, written in terms of the primitive variables, is computed via a volume-averaged nodal projection operator that is constructed from the Kirchhoff constraint of the three-field mixed weak form. The stability of the method is rendered by adding bubble-like enrichment to the rotation degrees of freedom. Some benchmark problems are presented to demonstrate the accuracy and performance of the proposed method for a wide range of plate thicknesses.

math.NA↗