8,317 research outputs found
Developments and trends in three-dimensional mesh generation
An intense research effort over the last few years has produced several competing and apparently diverse methods for generating meshes. Recent progress is reviewed and the central themes are emphasized which form a solid foundation for future developments in mesh generation
Analysis of and workarounds for element reversal for a finite element-based algorithm for warping triangular and tetrahedral meshes
We consider an algorithm called FEMWARP for warping triangular and
tetrahedral finite element meshes that computes the warping using the finite
element method itself. The algorithm takes as input a two- or three-dimensional
domain defined by a boundary mesh (segments in one dimension or triangles in
two dimensions) that has a volume mesh (triangles in two dimensions or
tetrahedra in three dimensions) in its interior. It also takes as input a
prescribed movement of the boundary mesh. It computes as output updated
positions of the vertices of the volume mesh. The first step of the algorithm
is to determine from the initial mesh a set of local weights for each interior
vertex that describes each interior vertex in terms of the positions of its
neighbors. These weights are computed using a finite element stiffness matrix.
After a boundary transformation is applied, a linear system of equations based
upon the weights is solved to determine the final positions of the interior
vertices. The FEMWARP algorithm has been considered in the previous literature
(e.g., in a 2001 paper by Baker). FEMWARP has been succesful in computing
deformed meshes for certain applications. However, sometimes FEMWARP reverses
elements; this is our main concern in this paper. We analyze the causes for
this undesirable behavior and propose several techniques to make the method
more robust against reversals. The most successful of the proposed methods
includes combining FEMWARP with an optimization-based untangler.Comment: Revision of earlier version of paper. Submitted for publication in
BIT Numerical Mathematics on 27 April 2010. Accepted for publication on 7
September 2010. Published online on 9 October 2010. The final publication is
available at http://www.springerlink.co
Kinetic Solvers with Adaptive Mesh in Phase Space
An Adaptive Mesh in Phase Space (AMPS) methodology has been developed for
solving multi-dimensional kinetic equations by the discrete velocity method. A
Cartesian mesh for both configuration (r) and velocity (v) spaces is produced
using a tree of trees data structure. The mesh in r-space is automatically
generated around embedded boundaries and dynamically adapted to local solution
properties. The mesh in v-space is created on-the-fly for each cell in r-space.
Mappings between neighboring v-space trees implemented for the advection
operator in configuration space. We have developed new algorithms for solving
the full Boltzmann and linear Boltzmann equations with AMPS. Several recent
innovations were used to calculate the discrete Boltzmann collision integral
with dynamically adaptive mesh in velocity space: importance sampling,
multi-point projection method, and the variance reduction method. We have
developed an efficient algorithm for calculating the linear Boltzmann collision
integral for elastic and inelastic collisions in a Lorentz gas. New AMPS
technique has been demonstrated for simulations of hypersonic rarefied gas
flows, ion and electron kinetics in weakly ionized plasma, radiation and light
particle transport through thin films, and electron streaming in
semiconductors. We have shown that AMPS allows minimizing the number of cells
in phase space to reduce computational cost and memory usage for solving
challenging kinetic problems
- …