Abstract:

A group of asymmetric difference schemes to approximate Kuramoto-Sivashinsky equation are given. Using the schemes, the alternating group method for solving Kuramoto-Sivashinsky equation is constructed. The scheme is linear unconditionally stable by analysis of linearization procedure, and is used directly on the parallel computer. The numerical experiments show the method has near the fourth order ratio of convergence in space.

Key words: Kuramoto-Sivashinsky equation; parallel computation; alternating group method; linear unconditionally stable