Abstract

This paper develops an algorithm for radial basis function (RBF) local node refinement and implements it for vortex roll-up and transport on a sphere. A heuristic based on an electrostatic repulsion type principle is used to re-distribute the nodes, clustering in areas where higher resolution is needed. It is then important to have a scheme that varies the shape of the RBFs over the domain so as to counteract the effects of Runge phenomena where the nodes are sparse. The roll-up of two diametrically opposed moving vortices are studied. The performance differences between near-uniform and refined nodes are addressed in terms of convergence, time stability, and computational cost. RBF results are put into context by comparison with published results for methods such as finite volume and discontinuous Galerkin.

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.