12 research outputs found

    Maximally-fast coarsening algorithms

    Full text link
    We present maximally-fast numerical algorithms for conserved coarsening systems that are stable and accurate with a growing natural time-step Ξ”t=Ats2/3\Delta t=A t_s^{2/3}. For non-conserved systems, only effectively finite timesteps are accessible for similar unconditionally stable algorithms. We compare the scaling structure obtained from our maximally-fast conserved systems directly against the standard fixed-timestep Euler algorithm, and find that the error scales as A\sqrt{A} -- so arbitrary accuracy can be achieved.Comment: 5 pages, 3 postscript figures, Late

    Controlling the accuracy of unconditionally stable algorithms in Cahn-Hilliard Equation

    Full text link
    Given an unconditionally stable algorithm for solving the Cahn-Hilliard equation, we present a general calculation for an analytic time step \d \tau in terms of an algorithmic time step \dt. By studying the accumulative multi-step error in Fourier space and controlling the error with arbitrary accuracy, we determine an improved driving scheme \dt=At^{2/3} and confirm the numerical results observed in a previous study \cite{Cheng1}.Comment: 4 pages, late
    corecore