2,203 research outputs found
A geometric discretization and a simple implementation for variational mesh generation and adaptation
We present a simple direct discretization for functionals used in the
variational mesh generation and adaptation. Meshing functionals are discretized
on simplicial meshes and the Jacobian matrix of the continuous coordinate
transformation is approximated by the Jacobian matrices of affine mappings
between elements. The advantage of this direct geometric discretization is that
it preserves the basic geometric structure of the continuous functional, which
is useful in preventing strong decoupling or loss of integral constraints
satisfied by the functional. Moreover, the discretized functional is a function
of the coordinates of mesh vertices and its derivatives have a simple
analytical form, which allows a simple implementation of variational mesh
generation and adaptation on computer. Since the variational mesh adaptation is
the base for a number of adaptive moving mesh and mesh smoothing methods, the
result in this work can be used to develop simple implementations of those
methods. Numerical examples are given.Comment: Corrected and improved versio
On the mesh nonsingularity of the moving mesh PDE method
The moving mesh PDE (MMPDE) method for variational mesh generation and
adaptation is studied theoretically at the discrete level, in particular the
nonsingularity of the obtained meshes. Meshing functionals are discretized
geometrically and the MMPDE is formulated as a modified gradient system of the
corresponding discrete functionals for the location of mesh vertices. It is
shown that if the meshing functional satisfies a coercivity condition, then the
mesh of the semi-discrete MMPDE is nonsingular for all time if it is
nonsingular initially. Moreover, the altitudes and volumes of its elements are
bounded below by positive numbers depending only on the number of elements, the
metric tensor, and the initial mesh. Furthermore, the value of the discrete
meshing functional is convergent as time increases, which can be used as a
stopping criterion in computation. Finally, the mesh trajectory has limiting
meshes which are critical points of the discrete functional. The convergence of
the mesh trajectory can be guaranteed when a stronger condition is placed on
the meshing functional. Two meshing functionals based on alignment and
equidistribution are known to satisfy the coercivity condition. The results
also hold for fully discrete systems of the MMPDE provided that the time step
is sufficiently small and a numerical scheme preserving the property of
monotonically decreasing energy is used for the temporal discretization of the
semi-discrete MMPDE. Numerical examples are presented.Comment: Revised and improved version of the WIAS preprin
A comparative numerical study of meshing functionals for variational mesh adaptation
We present a comparative numerical study for three functionals used for
variational mesh adaptation. One of them is a generalisation of Winslow's
variable diffusion functional while the others are based on equidistribution
and alignment. These functionals are known to have nice theoretical properties
and work well for most mesh adaptation problems either as a stand-alone
variational method or combined within the moving mesh framework. Their
performance is investigated numerically in terms of equidistribution and
alignment mesh quality measures. Numerical results in 2D and 3D are presented.Comment: Additional example (H1), journal referenc
Tetrahedral mesh improvement using moving mesh smoothing, lazy searching flips, and RBF surface reconstruction
Given a tetrahedral mesh and objective functionals measuring the mesh quality
which take into account the shape, size, and orientation of the mesh elements,
our aim is to improve the mesh quality as much as possible. In this paper, we
combine the moving mesh smoothing, based on the integration of an ordinary
differential equation coming from a given functional, with the lazy flip
technique, a reversible edge removal algorithm to modify the mesh connectivity.
Moreover, we utilize radial basis function (RBF) surface reconstruction to
improve tetrahedral meshes with curved boundary surfaces. Numerical tests show
that the combination of these techniques into a mesh improvement framework
achieves results which are comparable and even better than the previously
reported ones.Comment: Revised and improved versio
An anisotropic mesh adaptation method for the finite element solution of heterogeneous anisotropic diffusion problems
Heterogeneous anisotropic diffusion problems arise in the various areas of
science and engineering including plasma physics, petroleum engineering, and
image processing. Standard numerical methods can produce spurious oscillations
when they are used to solve those problems. A common approach to avoid this
difficulty is to design a proper numerical scheme and/or a proper mesh so that
the numerical solution validates the discrete counterpart (DMP) of the maximum
principle satisfied by the continuous solution. A well known mesh condition for
the DMP satisfaction by the linear finite element solution of isotropic
diffusion problems is the non-obtuse angle condition that requires the dihedral
angles of mesh elements to be non-obtuse. In this paper, a generalization of
the condition, the so-called anisotropic non-obtuse angle condition, is
developed for the finite element solution of heterogeneous anisotropic
diffusion problems. The new condition is essentially the same as the existing
one except that the dihedral angles are now measured in a metric depending on
the diffusion matrix of the underlying problem. Several variants of the new
condition are obtained. Based on one of them, two metric tensors for use in
anisotropic mesh generation are developed to account for DMP satisfaction and
the combination of DMP satisfaction and mesh adaptivity. Numerical examples are
given to demonstrate the features of the linear finite element method for
anisotropic meshes generated with the metric tensors.Comment: 34 page
Mesh smoothing: An MMPDE approach
We study a mesh smoothing algorithm based on the moving mesh PDE (MMPDE) method. For the MMPDE itself, we employ a simple and efficient direct geometric discretization of the underlying meshing functional on simplicial meshes. The nodal mesh velocities can be expressed in a simple, analytical matrix form, which makes the implementation of the method relatively easy and simple. Numerical examples are provided
On the mesh nonsingularity of the moving mesh PDE method
The moving mesh PDE (MMPDE) method for variational mesh generation and adaptation is studied theoretically at the discrete level, in particular the nonsingularity of the obtained meshes. Meshing functionals are discretized geometrically and the MMPDE is formulated as a modified gradient system of the corresponding discrete functionals for the location of mesh vertices. It is shown that if the meshing functional satisfies a coercivity condition, then the mesh of the semi-discrete MMPDE is nonsingular for all time if it is nonsingular initially. Moreover, the altitudes and volumes of its elements are bounded below by positive numbers depending only on the number of elements, the metric tensor, and the initial mesh. Furthermore, the value of the discrete meshing functional is convergent as time increases, which can be used as a stopping criterion in computation. Finally, the mesh trajectory has limiting meshes which are critical points of the discrete functional. The convergence of the mesh trajectory can be guaranteed when a stronger condition is placed on the meshing functional. Two meshing functionals based on alignment and equidistribution are known to satisfy the coercivity condition. The results also hold for fully discrete systems of the MMPDE provided that the time step is sufficiently small and a numerical scheme preserving the property of monotonically decreasing energy is used for the temporal discretization of the semi-discrete MMPDE. Numerical examples are presente
- …