Abstract
In this paper, we pursue further analysis of the performance of a compact structure‐preserving finite difference scheme. The convergence, stability, and accuracy of the approximate solution with respect to grid refinement are discussed. The compact difference approach to precisely preserving invariants on any time‐space regions gives a three‐level linear‐implicit scheme with the spatial accuracy, found to be fourth order on a uniform grid. The method is verified by comparison with a solution of the Rosenau–Kawahara equation just obtained with second‐order finite difference schemes recently. Also, the efficiency of the present algorithm is confirmed by simulations of the problem at a long time. Details of CPU time are examined in order to assess the usefulness of the compact scheme for determining an approximate solution.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
