A semi-discrete numerical scheme for nonlocally regularized KdV-type equations

Erbay, Hüsnü Ata and Erbay, Saadet and Erkip, Albert (2022) A semi-discrete numerical scheme for nonlocally regularized KdV-type equations. Applied Numerical Mathematics, 175 . pp. 29-39. ISSN 0168-9274 (Print) 1873-5460 (Online)

[thumbnail of Arxiv_2022_A_semi_discrete_numerical_scheme.pdf] PDF
Arxiv_2022_A_semi_discrete_numerical_scheme.pdf

Download (306kB)

Abstract

A general class of KdV-type wave equations regularized with a convolution-type nonlocality in space is considered. The class differs from the class of the nonlinear nonlocal unidirectional wave equations previously studied by the addition of a linear convolution term involving third-order derivative. To solve the Cauchy problem we propose a semi-discrete numerical method based on a uniform spatial discretization, that is an extension of a previously published work of the present authors. We prove uniform convergence of the numerical method as the mesh size goes to zero. We also prove that the localization error resulting from localization to a finite domain is significantly less than a given threshold if the finite domain is large enough. To illustrate the theoretical results, some numerical experiments are carried out for the Rosenau-KdV equation, the Rosenau-BBM-KdV equation and a convolution-type integro-differential equation. The experiments conducted for three particular choices of the kernel function confirm the error estimates that we provide.
Item Type: Article
Uncontrolled Keywords: Discretization; Error estimates; KdV equation; Nonlocal nonlinear wave equation; Rosenau equation; Semi-discrete scheme
Subjects: Q Science > QA Mathematics > QA299.6-433 Analysis
Divisions: Faculty of Engineering and Natural Sciences > Basic Sciences > Mathematics
Faculty of Engineering and Natural Sciences
Depositing User: Albert Erkip
Date Deposited: 11 Feb 2022 14:52
Last Modified: 25 Aug 2022 13:09
URI: https://research.sabanciuniv.edu/id/eprint/42739

Actions (login required)

View Item
View Item