SUMMARYGmsh is an open-source 3-D finite element grid generator with a build-in CAD engine and post-processor. Its design goal is to provide a fast, light and user-friendly meshing tool with parametric input and advanced visualization capabilities. This paper presents the overall philosophy, the main design choices and some of the original algorithms implemented in Gmsh.

We present a new algorithm for the numerical solution of problems of electromagnetic or acoustic scattering by large, convex obstacles. This algorithm combines the use of an ansatz for the unknown density in a boundary-integral formulation of the scattering problem with an extension of the ideas of the method of stationary phase. We include numerical results illustrating the high-order convergence of our algorithm as well as its asymptotically bounded computational cost as the frequency increases.

No abstract

This paper presents a new non-overlapping domain decomposition method for the Helmholtz equation, whose effective convergence is quasi-optimal. These improved properties result from a combination of an appropriate choice of transmission conditions and a suitable approximation of the Dirichlet to Neumann operator. A convergence theorem of the algorithm is established and numerical results validating the new approach are presented in both two and three dimensions.

In order to predict the effective properties of heterogeneous materials using the finite element approach, a boundary value problem (BVP) may be defined on a representative volume element (RVE) with appropriate boundary conditions, among which periodic boundary condition is the most efficient in terms of convergence rate. The classical method to impose the periodic boundary condition requires the identical meshes on opposite RVE boundaries. This condition is not always easy to satisfy for arbitrary meshes. This work develops a new method based on polynomial interpolation that avoids the need of matching mesh condition on opposite RVE boundaries.

No abstract

Cross fields are auxiliary in the generation of quadrangular meshes. A method to generate cross fields on surface manifolds is presented in this paper. Algebraic topology constraints on quadrangular meshes are first discussed. The duality between quadrangular meshes and cross fields is then outlined, and a generalization to cross fields of the Poincaré-Hopf theorem is proposed, which highlights some fundamental and important topological constraints on cross fields. A finite element formulation for the computation of cross fields is then presented, which is based on Ginzburg-Landau equations and makes use of edge-based Crouzeix-Raviart interpolation functions. It is first presented in the planar case, and then extended to a general surface manifold. Finally, application examples are solved and discussed.

This paper presents a preconditioner for non-overlapping Schwarz methods applied to the Helmholtz problem. Starting from a simple analytic example, we show how such a preconditioner can be designed by approximating the inverse of the iteration operator for a layered partitioning of the domain. The preconditioner works by propagating information globally by concurrently sweeping in both directions over the subdomains, and can be interpreted as a coarse grid for the domain decomposition method. The resulting algorithm is shown to converge very fast, independently of the number of subdomains and frequency. The preconditioner has the advantage that, like the original Schwarz algorithm, it can be implemented as a matrix-free routine, with no additional preprocessing.