Abstract

AbstractMoving mesh methods provide an efficient way of solving partial differential equations for which large, localised variations in the solution necessitate locally dense spatial meshes. In one-dimension, meshes are typically specified using the arclength mesh density function. This choice is well-justified for piecewise polynomial interpolants, but it is only justified for spectral methods when model solutions include localised steep gradients. In this paper, one-dimensional mesh density functions are presented which are based on a spatially localised measure of the bandwidth of the approximated model solution. In considering bandwidth, these mesh density functions are well-justified for spectral methods, but are not strictly tied to the error properties of any particular spatial interpolant, and are hence widely applicable. The bandwidth mesh density functions are illustrated in two ways. First, by applying them to Chebyshev polynomial approximation of two test functions, and second, through use in periodic spectral and finite-difference moving mesh methods applied to a number of model problems in acoustics. These problems include a heterogeneous advection equation, the viscous Burgers’ equation, and the Korteweg-de Vries equation. Simulation results demonstrate solution convergence rates that are up to an order of magnitude faster using the bandwidth mesh density functions than uniform meshes, and around three times faster than those using the arclength mesh density function.

Full Text
Paper version not known

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 call

Disclaimer: 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.