Table of Content

Open Access

ARTICLE

An Efficient Backward Group Preserving Scheme for the Backward in Time Burgers Equation

Chein-Shan Liu1
Department of Mechanicaland Mechatronic Engineering, Taiwan Ocean University, Keelung, Taiwan. E-mail: csliu@mail.ntou.edu.tw

Computer Modeling in Engineering & Sciences 2006, 12(1), 55-66. https://doi.org/10.3970/cmes.2006.012.055

Abstract

In this paper we are concerned with the numerical integration of Burgers equation backward in time. We construct a one-step backward group preserving scheme (BGPS) for the semi-discretization of Burgers equation. The one-step BGPS is very effectively to calculate the solution at an initial time t = 0 from a given final data at t = T, which with a time stepsize equal to T and with a suitable grid length produces a highly accurate solution never seen before. Under noisy final data the BGPS is also robust to against the disturbance. When the solution appears steep gradient, several steps BGPS can be used to retrieve the desired initial data.

Keywords

Past cone dynamics, Backward group preserving scheme, Backward Burgers equation, Ill-posed problem.

Cite This Article

Liu, C. (2006). An Efficient Backward Group Preserving Scheme for the Backward in Time Burgers Equation. CMES-Computer Modeling in Engineering & Sciences, 12(1), 55–66.



This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 735

    View

  • 645

    Download

  • 0

    Like

Share Link

WeChat scan