Maximally fast algorithm for Cahn-Hilliard equation

March 18, 2007

Here is a follow-up paper on the unconditionally stable time step for diffuse interface methods.

Paper: Maximally fast coarsening algorithms

Authors: Mowei Cheng and Andrew D. Rutenberg


We present maximally fast numerical algorithms for conserved coarsening systems thatare stable and accurate with a growing natural time step \Delta t = A t_{s}^{2/3}. We compare the scaling structure obtained from our maximally fast conserved systems directly against the standard fixed time-step Euler algorithm, and find that the error scales as \sqrt{A}—so arbitrary accuracy can be achieved. For non-conserved systems, only effectively finite time steps are accessible for similar unconditionally stable algorithms.


Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: