Year: 2024
Author: Chunjie Zhang, Changxin Qiu, Xiaofang Zhou, Xiaoming He
Advances in Applied Mathematics and Mechanics, Vol. 16 (2024), Iss. 4 : pp. 833–859
Abstract
In this paper, we develop a cell-average based neural network (CANN) method for solving the Hunter-Saxton equation with its zero-viscosity and zero-dispersion limits. Motivated from the finite volume schemes, the cell-average based neural network method is constructed based on the finite volume integrals of the original PDEs. Supervised training is designed to learn the solution average difference between two neighboring time steps. The training data set is generated by the cell average based on a single initial value of the given PDE. The training process employs multiple time levels of cell averages to maintain stability and control temporal accumulation errors. After being well trained based on appropriate meshes, this method can be utilized like a regular explicit finite volume method to evolve the solution under large time steps. Furthermore, it can be applied to solve different type of initial value problems without retraining the neural network. In order to validate the capability and robustness of the CANN method, we also utilize it to deal with the corrupted learning data which is generated from the Gaussian white noise. Several numerical examples of different types of Hunter-Saxton equations are presented to demonstrate the effectiveness, accuracy, capability, and robustness of the proposed method.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/10.4208/aamm.OA-2022-0278
Advances in Applied Mathematics and Mechanics, Vol. 16 (2024), Iss. 4 : pp. 833–859
Published online: 2024-01
AMS Subject Headings: Global Science Press
Copyright: COPYRIGHT: © Global Science Press
Pages: 27
Keywords: Finite volume scheme cell-average based neural network Hunter-Saxton equation corruption data.