2014
DOI: 10.1002/num.21899
|View full text |Cite
|
Sign up to set email alerts
|

A Fourier pseudospectral method for the “good” Boussinesq equation with second‐order temporal accuracy

Abstract: In this article, we discuss the nonlinear stability and convergence of a fully discrete Fourier pseudospectral method coupled with a specially designed second-order time-stepping for the numerical solution of the "good" Boussinesq equation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
36
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
6
2

Relationship

2
6

Authors

Journals

citations
Cited by 70 publications
(37 citation statements)
references
References 60 publications
0
36
0
Order By: Relevance
“…But for models whose exact solutions hardly are found, the numerical method is an alternative choice. Especially, high-accuracy numerical algorithms [2,3,4,12,25], which maintain the conservative properties of the initial equation, could guarantee the validity of the numerical approximation. Because the high accuracy could guarantee the precision of the approximation, and the conservatives make the approximate solution reflect the physical phenomena better.…”
Section: Introductionmentioning
confidence: 99%
“…But for models whose exact solutions hardly are found, the numerical method is an alternative choice. Especially, high-accuracy numerical algorithms [2,3,4,12,25], which maintain the conservative properties of the initial equation, could guarantee the validity of the numerical approximation. Because the high accuracy could guarantee the precision of the approximation, and the conservatives make the approximate solution reflect the physical phenomena better.…”
Section: Introductionmentioning
confidence: 99%
“…It is closely related to the Fourier spectral method, but complements the basis by an additional pseudo-spectral basis, which allows to represent functions on a quadrature grid. This simplifies the evaluation of certain operators, and can considerably speed up the calculation when using fast algorithms such as the fast Fourier transform (FFT); see the related descriptions in [5,10,13,14,29,30,35,55,56].…”
Section: The Numerical Scheme 21 Fourier Pseudo-spectral Approximationsmentioning
confidence: 99%
“…We observe that the conservation of the linear invariants (6) and (7) is implicitly gained, by virtue of Theorem 4, through the definition of the semi-discrete problem obtained by truncating the series in (15) and (16). As matter of fact, their conservation is satisfied by all the above methods and, therefore, it will not be checked further.…”
Section: Numerical Testsmentioning
confidence: 99%
“…Hereafter, we shall assume that u 0 (x) and v 0 (x) are such that the solution of problem (4) and (5) is regular enough, as a periodic function on [a, b], for all t ≥ 0. The numerical solution of (1), (3) or (4) has been developed along different directions, ranging from the pseudo-spectral or splitting approach [13][14][15][16][17][18][19]46], up to finite-difference and finite-element schemes [20][21][22][23][24]47], as well as structure-preserving methods [10,25,26] and energy-preserving methods [27,28]. In particular, [11,12] consider an energy-conserving strategy based on the Hamiltonian boundary value methods (HBVMs) for the "good" Boussinesq and the improved Boussinesq equation, respectively, while a second-order symplectic method preserving the energy and the momentum is considered in [29].…”
Section: Introductionmentioning
confidence: 99%