arXiv subjects

L. Beirão da Veiga

Publications and source records attributed to L. Beirão da Veiga.

26 records · Page 2Linked to original sources

arXiv2018

A family of three-dimensional virtual elements with applications to magnetostatic

We consider, as a simple model problem, the application of Virtual Element Methods (VEM) to the linear Magnetostatic three-dimensional problem in the formulation of F. Kikuchi. In doing so, we also introduce new serendipity VEM spaces, where the serendipity reduction is made only on the faces of a general polyhedral decomposition (assuming that internal degrees of freedom could be more easily eliminated by static condensation). These new spaces are meant, more generally, for the combined approximation of $H^1$-conforming ($0$-forms), $H({\rm {\bf curl}})$-conforming ($1$-forms), and $H({\rm div})$-conforming ($2$-forms) functional spaces in three dimensions, and they would surely be useful for other problems and in more general contexts.

math.NA↗

arXiv2017

Lowest order Virtual Element approximation of magnetostatic problems

We give here a simplified presentation of the lowest order Serendipity Virtual Element method, and show its use for the numerical solution of linear magneto-static problems in three dimensions. The method can be applied to very general decompositions of the computational domain (as is natural for Virtual Element Methods) and uses as unknowns the (constant) tangential component of the magnetic field $\mathbf{H}$ on each edge, and the vertex values of the Lagrange multiplier $p$ (used to enforce the solenoidality of the magnetic induction $\mathbf{B}=μ\mathbf{H}$). In this respect the method can be seen as the natural generalization of the lowest order Edge Finite Element Method (the so-called "first kind Nédélec" elements) to polyhedra of almost arbitrary shape, and as we show on some numerical examples it exhibits very good accuracy (for being a lowest order element) and excellent robustness with respect to distortions.

math.NA↗

arXiv2017

High-order Virtual Element Method on polyhedral meshes

We develop a numerical assessment of the Virtual Element Method for the discretization of a diffusion-reaction model problem, for higher "polynomial" order k and three space dimensions. Although the main focus of the present study is to illustrate some h-convergence tests for different orders k, we also hint on other interesting aspects such as structured polyhedral Voronoi meshing, robustness in the presence of irregular grids, sensibility to the stabilization parameter and convergence with respect to the order k.

math.NA↗

arXiv2017

Virtual Elements for the Navier-Stokes problem on polygonal meshes

A family of Virtual Element Methods for the 2D Navier-Stokes equations is proposed and analysed. The schemes provide a discrete velocity field which is point-wise divergence-free. A rigorous error analysis is developed, showing that the methods are stable and optimally convergent. Several numerical tests are presented, confirming the theoretical predictions. A comparison with some mixed finite elements is also performed.

math.NA↗

arXiv2015

Basic principles of hp Virtual Elements on quasiuniform meshes

In the present paper we initiate the study of $hp$ Virtual Elements. We focus on the case with uniform polynomial degree across the mesh and derive theoretical convergence estimates that are explicit both in the mesh size $h$ and in the polynomial degree $p$ in the case of finite Sobolev regularity. Exponential convergence is proved in the case of analytic solutions. The theoretical convergence results are validated in numerical experiments. Finally, an initial study on the possible choice of local basis functions is included.

math.NA↗

arXiv2015

A Virtual Element Method for elastic and inelastic problems on polytope meshes

We present a Virtual Element Method (VEM) for possibly nonlinear elastic and inelastic problems, mainly focusing on a small deformation regime. The numerical scheme is based on a low-order approximation of the displacement field, as well as a suitable treatment of the displacement gradient. The proposed method allows for general polygonal and polyhedral meshes, it is efficient in terms of number of applications of the constitutive law, and it can make use of any standard black-box constitutive law algorithm. Some theoretical results have been developed for the elastic case. Several numerical results within the 2D setting are presented, and a brief discussion on the extension to large deformation problems is included.

math.NA↗

arXiv2014

Virtual Element Methods for general second order elliptic problems on polygonal meshes

We consider the discretization of a boundary value problem for a general linear second-order elliptic operator with smooth coefficients using the Virtual Element approach. As in [59] the problem is supposed to have a unique solution, but the associated bilinear form is not supposed to be coercive. Contrary to what was previously done for Virtual Element Methods (as for instance in [9]), we use here, in a systematic way, the L^2-projection operators as designed in [1]. In particular, the present method does not reduce to the original Virtual Element Method of [9] for simpler problems as the classical Laplace operator (apart from the lowest order cases). Numerical experiments show the accuracy and the robustness of the method, and they show as well that a simple-minded extension of the method in [9] to the case of variable coefficients produces, in general, sub-optimal results.

math.NA↗

arXiv2011

An isogeometric method for the Reissner-Mindlin plate bending problem

We present a new isogeometric method for the discretization of the Reissner-Mindlin plate bending problem. The proposed scheme follows a recent theoretical framework that makes possible to construct a space of smooth discrete deflections $W_h$ and a space of smooth discrete rotations $\Rots_h$ such that the Kirchhoff contstraint is exactly satisfied at the limit. Therefore we obtain a formulation which is natural from the theoretical/mechanical viewpoint and locking free by construction.

math.NA↗