Evaluation of the quad oriented meshing algorithms in Gmsh

In this paper we benchmark the performance of three algorithms for generating quad dominated surface meshes of the geometric models in ship structural analysis. We compare algorithms based on the combinatorial approach of packing the surfaces with parallelograms and those algorithms which are based on the variants of the Delaunay advancing front approaches. The meshing in ships structural analysis is specific in that the restrictions on the algorithm are defined by the rules of the ship classification societies which contain linear restrictions on the geometry. Linear restrictions are directly at odds with the principles of the Delaunay advancing front approaches. We present a specific quality indicator for assessing the quality of such meshes and compare three available algorithms in Gmsh. Finally, we assess the performance of our preconditioning strategy for these algorithms and argue for its suitability for the task

Evaluation of the quad oriented meshing algorithms in Gmsh

In this paper we benchmark the performance of three algorithms for generating quad dominated surface meshes of the geometric models in ship structural analysis. We compare algorithms based on the combinatorial approach of packing the surfaces with parallelograms and those algorithms which are based on the variants of the Delaunay advancing front approaches. The meshing in ships structural analysis is specific in that the restrictions on the algorithm are defined by the rules of the ship classification societies which contain linear restrictions on the geometry. Linear restrictions are directly at odds with the principles of the Delaunay advancing front approaches. We present a specific quality indicator for assessing the quality of such meshes and compare three available algorithms in Gmsh. Finally, we assess the performance of our preconditioning strategy for these algorithms and argue for its suitability for the task

Conjugate Function Method for Numerical Conformal Mappings

We present a method for numerical computation of conformal mappings from simply or doubly connected domains onto so-called canonical domains, which in our case are rectangles or annuli. The method is based on conjugate harmonic functions and properties of quadrilaterals. Several numerical examples are given.Comment: 23 pages, 15 figures, 5 table

A case study in hexahedral mesh generation: Simulation of the human mandible

We provide a case study for the generation of pure hexahedral meshes for the numerical simulation of physiological stress scenarios of the human mandible. Due to its complex and very detailed free-form geometry, the mandible model is very demanding. This test case is used as a running example to demonstrate the applicability of a combinatorial approach for the generation of hexahedral meshes by means of successive dual cycle eliminations, which has been proposed by the second author in previous work. We report on the progress and recent advances of the cycle elimination scheme. The given input data, a surface triangulation obtained from computed tomography data, requires a substantial mesh reduction and a suitable conversion into a quadrilateral surface mesh as a first step, for which we use mesh clustering and b-matching techniques. Several strategies for improved cycle elimination orders are proposed. They lead to a significant reduction in the mesh size and a better structural quality. Based on the resulting combinatorial meshes, gradient-based optimized smoothing with the condition number of the Jacobian matrix as objective together with mesh untangling techniques yielded embeddings of a satisfactory quality. To test our hexahedral meshes for the mandible model within an FEM simulation we used the scenario of a bite on a ‘hard nut.’ Our simulation results are in good agreement with observations from biomechanical experiments

Doctor of Philosophy

dissertationInverse Electrocardiography (ECG) aims to noninvasively estimate the electrophysiological activity of the heart from the voltages measured at the body surface, with promising clinical applications in diagnosis and therapy. The main challenge of this emerging technique lies in its mathematical foundation: an inverse source problem governed by partial differential equations (PDEs) which is severely ill-conditioned. Essential to the success of inverse ECG are computational methods that reliably achieve accurate inverse solutions while harnessing the ever-growing complexity and realism of the bioelectric simulation. This dissertation focuses on the formulation, optimization, and solution of the inverse ECG problem based on finite element methods, consisting of two research thrusts. The first thrust explores the optimal finite element discretization specifically oriented towards the inverse ECG problem. In contrast, most existing discretization strategies are designed for forward problems and may become inappropriate for the corresponding inverse problems. Based on a Fourier analysis of how discretization relates to ill-conditioning, this work proposes refinement strategies that optimize approximation accuracy o f the inverse ECG problem while mitigating its ill-conditioning. To fulfill these strategies, two refinement techniques are developed: one uses hybrid-shaped finite elements whereas the other adapts high-order finite elements. The second research thrust involves a new methodology for inverse ECG solutions called PDE-constrained optimization, an optimization framework that flexibly allows convex objectives and various physically-based constraints. This work features three contributions: (1) fulfilling optimization in the continuous space, (2) formulating rigorous finite element solutions, and (3) fulfilling subsequent numerical optimization by a primal-dual interiorpoint method tailored to the given optimization problem's specific algebraic structure. The efficacy o f this new method is shown by its application to localization o f cardiac ischemic disease, in which the method, under realistic settings, achieves promising solutions to a previously intractable inverse ECG problem involving the bidomain heart model. In summary, this dissertation advances the computational research of inverse ECG, making it evolve toward an image-based, patient-specific modality for biomedical research

Energy-norm-based and goal-oriented automatic hp adaptivity for electromagnetics: Application to waveguide Discontinuities

The finite-element method (FEM) enables the use of adapted meshes. The simultaneous combination of h (local variations in element size) and p (local variations in the polynomial order of approximation) refinements, i.e., hp-adaptivity, is the most powerful and flexible type of adaptivity. In this paper, two versions of a fully automatic hp-adaptive FEM for electromagnetics are presented. The first version is based on minimizing the energy-norm of the error. The second, namely the goal oriented strategy, is based on minimizing the error of a given (user-prescribed) quantity of interest. The adaptive strategy delivers exponential convergence rates for the error, even in the presence of singularities. The hp adaptivity is presented in the context of 2-D analysis of H -plane rectangular waveguide discontinuities. Stabilized variational formulations and H(curl) FEM discretizations in terms of quadrilaterals of variable order of approximation supporting anisotropy and hanging nodes are used. Comparison of energy-norm and goal-oriented hp-adaptive strategies in the context of waveguiding problems is provided. Specifically, the scattering parameters of the discontinuity are used as goal

An algorithm for mesh refinement and un-refinement in fast transient dynamics

A procedure to locally refine and un-refine an unstructured computational grid of four-node quadrilaterals (in 2D) or of eight-node hexahedra (in 3D) is presented. The chosen refinement strategy generates only elements of the same type as their parents, but also produces so-called hanging nodes along non-conforming element-to-element interfaces. Continuity of the solution across such interfaces is enforced strongly by Lagrange multipliers. The element split and un-split algorithm is entirely integer-based. It relies only upon element connectivity and makes no use of nodal coordinates or other real-number quantities. The chosen data structure and the continuous tracking of the nature of each node facilitate the treatment of natural and essential boundary conditions in adaptivity. A generalization of the concept of neighbor elements allows transport calculations in adaptive fluid calculations. The proposed procedure is tested in structure and fluid wave propagation problems in explicit transient dynamics