Remarks on the accuracy of algorithms for motion by mean curvature in bounded domains

Details Remarks on the accuracy of algorithms for motion by mean curvature in bounded domains Remarks on the accuracy of algorithms for motion by mean curvature in bounded domains

2008-03-26

arxiv.org/abs/0803.3719v2

Physics

Condensed Matter

Soft Condensed Matter

15 pages, 7 figures. Minor corrections to improve clarity, and further references added

Scientific paper

Simulations of motion by mean curvature in bounded domains, with applications to bubble motion and grain growth, rely upon boundary conditions that are only approximately compatible with the equation of motion. Three closed form solutions for the problem exist, governing translation, rotation and expansion of a single interface [1], providing the only benchmarks for algorithm verification. We derive new identities for the translation solution. Then we estimate the accuracy of a straightforward algorithm to recover the analytical solution for different values of the velocity V given along the boundary. As expected, for large V the error can reach unacceptable levels especially near the boundary. We discuss factors influencing the accuracy and propose a simple modification of the algorithm which improves the computational accuracy.

Affiliated with

Also associated with

No associations

Rating

Remarks on the accuracy of algorithms for motion by mean curvature in bounded domains does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Remarks on the accuracy of algorithms for motion by mean curvature in bounded domains, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Remarks on the accuracy of algorithms for motion by mean curvature in bounded domains will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-49910