Linear and Nonlinear Parareal Methods for the Cahn-Hilliard Equation

04/27/2023
by   Gobinda Garai, et al.
0

In this paper, we propose, analyze and implement efficient time parallel methods for the Cahn-Hilliard (CH) equation. It is of great importance to develop efficient numerical methods for the CH equation, given the range of applicability of the CH equation has. The CH equation generally needs to be simulated for a very long time to get the solution of phase coarsening stage. Therefore it is desirable to accelerate the computation using parallel method in time. We present linear and nonlinear Parareal methods for the CH equation depending on the choice of fine approximation. We illustrate our results by numerical experiments.

READ FULL TEXT
research
07/08/2021

Convergence of the Neumann-Neumann Method for the Cahn-Hilliard Equation

In this paper, we analyze a substructuring type algorithm for the Cahn-H...
research
04/05/2022

Root finding techniques that work

In most introductory numerical analysis textbooks, the treatment of a si...
research
08/04/2019

The numerical approximation of the Schrödinger equation with concentrated potential

We present a family of algorithms for the numerical approximation of the...
research
09/05/2018

Parallel numerical method for nonlocal-in-time Schrödinger equation

We present a new parallel numerical method for solving the non-stationar...
research
07/05/2023

Computation of excited states for the nonlinear Schrödinger equation: numerical and theoretical analysis

Our goal is to compute excited states for the nonlinear Schrödinger equa...
research
12/03/2021

Convergence of substructuring Methods for the Cahn-Hilliard Equation

In this paper, we formulate and study substructuring type algorithm for ...
research
06/26/2023

An orthogonalization-free implementation of the LOBPCG method in solving Kohn-Sham equation

In the classic implementation of the LOBPCG method, orthogonalization an...

Please sign up or login with your details

Forgot password? Click here to reset