Abstract

This study aimed at investigating a local radial basis function collocation method (LRBFCM) in the reproducing kernel Hilbert space. This method was, in fact, a meshless one which applied the local sub-clusters of domain nodes for the approximation of the arbitrary field. For time-dependent partial differential equations (PDEs), it would be changed to a system of ordinary differential equations (ODEs). Here, we intended to decrease the error through utilizing variable shape parameter (VSP) strategies. This method was an appropriate way to solve the two-dimensional nonlinear coupled Burgers’ equations comprised of Dirichlet and mixed boundary conditions. Numerical examples indicated that the variable shape parameter strategies were more efficient than constant ones for various values of the Reynolds number.

Highlights

  • Contrary to conventional numerical methods in solving the partial differential equations (PDEs), meshless methods [1], it is not essential to utilize meshes

  • Collocation methods are, meshless and easy to program. They allow some kinds of approaches to solve the PDEs

  • We have proposed some strategies to choose the variable shape parameter (VSP): strategy 1 :

Read more

Summary

Introduction

Contrary to conventional numerical methods in solving the partial differential equations (PDEs), meshless methods [1], it is not essential to utilize meshes. Collocation methods are, meshless and easy to program They allow some kinds of approaches to solve the PDEs. Considering the translation of kernels as trial functions, meshless collocation in asymmetric and symmetric forms is described in [2,3,4]. Considering the translation of kernels as trial functions, meshless collocation in asymmetric and symmetric forms is described in [2,3,4] It is highly successful, since the arising linear systems are easy to produce, leading to such good accuracy with the beneficial range of computational expenses. Since the arising linear systems are easy to produce, leading to such good accuracy with the beneficial range of computational expenses It has been newly proven [5] that the symmetric collocation [2,3] utilizing kernel basis is optimal along all linear

Objectives
Methods
Results
Conclusion

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.