Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

On the mesh nonsingularity of the moving mesh PDE method
HTML articles powered by AMS MathViewer

by Weizhang Huang and Lennard Kamenski PDF
Math. Comp. 87 (2018), 1887-1911 Request permission

Abstract:

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.
References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC (2010): 65N50, 65K10
  • Retrieve articles in all journals with MSC (2010): 65N50, 65K10
Additional Information
  • Weizhang Huang
  • Affiliation: Department of Mathematics, The University of Kansas, Lawrence, Kansas 66045
  • MR Author ID: 326320
  • Email: whuang@ku.edu
  • Lennard Kamenski
  • Affiliation: Weierstrass Institute, Mohrenstr. 39, 10117 Berlin, Germany
  • ORCID: 0000-0001-5227-6891
  • Email: kamenski@wias-berlin.de
  • Received by editor(s): December 15, 2015
  • Received by editor(s) in revised form: February 3, 2017
  • Published electronically: October 2, 2017
  • Additional Notes: The first author was supported by the University of Kansas General Research Fund allocation #2301056.
  • © Copyright 2017 American Mathematical Society
  • Journal: Math. Comp. 87 (2018), 1887-1911
  • MSC (2010): Primary 65N50, 65K10
  • DOI: https://doi.org/10.1090/mcom/3271
  • MathSciNet review: 3787395