There are numerous applications for which the geometric domain moves as a function of time, e.g., flapping airplane wings, a beating heart, and clothing moving in the wind. A dynamic sequence of meshes is required in order to capture the changing geometry. In the first part of the talk, I will present parallel LBWARP, a parallel log barrierbased tetrahedral mesh warping algorithm for distributed memory machines. The algorithm is a generalpurpose, geometric dynamic meshing algorithm that parallelizes the sequential LBWARP algorithm by Shontz and Vavasis. The algorithm solves a large global system of linear equations in parallel to determine where to move the interior nodes of the mesh. This computation is based on the representation of the initial mesh and the deformation provided by the user. A logbarrier interior point method is used to solve several convex optimization problems to determine the representation of the initial mesh. Sparse linear solvers for problems with multiple righthand sides are used to solve the global systems of linear equations corresponding to multiple warping steps. I will present several numerical examples which demonstrate the excellent scalability properties of the method. In the second part of the talk, I will present LBWARP2Gen, a highorder curvilinear tetrahedral mesh generation and warping algorithm. The algorithm generates a secondorder mesh by deforming a linear tetrahedral mesh into a highorder mesh based on the LBWARP method. In particular, it first, adds a node at the midpoint of each edge; second, displaces the newly added boundary midpoints onto the curved boundary, and third, solves for the final positions of the interior nodes based on the boundary deformation (based on the representation of the initial highorder mesh and the mesh deformation). In this case, a logbarrier interior point method is used to solve the resulting nonconvex optimization problems. By allowing all of the boundary nodes to move, the approach can also be used to warp secondorder tetrahedral meshes. I will present numerical examples which demonstrate the success of the method in generating and warping highorder meshes. Parts of this talk represent joint work by Thap Panitanarak, The Pennsylvania State University, and Michael Stees, University of Kansas.
You are here
Optimizationbased Dynamic Mesh Algorithms for Use in Finite Element Simulations
Research Group:
Prof. Suzanne Michelle Shontz
Institution:
University of Kansas, USA
Location:
A134
Schedule:
Wednesday, June 21, 2017  11:00
Abstract:
Openings
Upcoming events

Professor
Pietro Fré
The Kähler Quotient Resolution of C3/Gamma singularities, the McKay correspondence and D=3 N=2 ChernSimons gauge theories
Thursday, October 19, 2017  14:30

Elefterios Soultanis
Energy minimizers and existence of lifts in NewtonSobolev classes of maps
Thursday, October 19, 2017  15:00
Today's Lectures

Davide Guzzetti
09:00 to 11:00

Alberto Sartori
14:15 to 16:15

Ugo Bruzzo
14:30 to 16:00

Luca Heltai  Gianluigi Rozza
16:00 to 18:00
Recent publications

F. Cagnetti; G. Dal Maso; L. Scardia; C.I. Zeppieri,GammaConvergence of Freedisc...

G. Lazzaroni; L. Nardini,Analysis of a dynamic peeling...

F. Iandoli; R. Scandone,Dispersive estimates for Schrö...

V. Georgiev; A. Michelangeli; R. Scandone,On fractional powers of singul...