Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
102 tokens/sec
GPT-4o
59 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
50 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Domain Decomposition Parabolic Monge-Ampère Approach for Fast Generation of Adaptive Moving Meshes (2006.14602v1)

Published 25 Jun 2020 in math.NA and cs.NA

Abstract: A fast method is presented for adaptive moving mesh generation in multi-dimensions using a domain decomposition parabolic Monge-Amp`ere approach. The domain decomposition procedure employed here is non-iterative and involves splitting the computational domain into overlapping subdomains. An adaptive mesh on each subdomain is then computed as the image of the solution of the $L2$ optimal mass transfer problem using a parabolic Monge-Amp`ere method. The domain decomposition approach allows straightforward implementation for the parallel computation of adaptive meshes which helps to reduce computational time significantly. Results are presented to show the numerical convergence of the domain decomposition solution to the single domain solution. Several numerical experiments are given to demonstrate the performance and efficiency of the proposed method. The numerical results indicate that the domain decomposition parabolic Monge-Amp`ere method is more efficient than the standard implementation of the parabolic Monge-Amp`ere method on the whole domain, in particular when computing adaptive meshes in three spatial dimensions.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Mohamed Sulman (1 paper)
  2. Truong Nguyen (29 papers)
  3. Ronald Haynes (3 papers)
  4. Weizhang Huang (59 papers)
Citations (4)

Summary

We haven't generated a summary for this paper yet.