Abstract

We present in this paper comparisons on the performances among five typical radial basis functions methods, namely radial basis collocation method (RBCM), radial basis Galerkin method (RBGM), compactly supported radial basis collocation method (CSRBCM), compactly supported radial basis Galerkin method (CSRBGM), and finite subdomain radial basis collocation method (FSRBCM), for solving problems arising from engineering industries and applied sciences. Numerical comparison results demonstrate that the RBCM and FSRBCM possess high accuracy and superior convergence rates in which the FSRBCM particularly attains higher accuracy for problems with large gradients. The FSRBCM, CSRBCM and RBCM are computationally efficient while the CSRBCM, CSRBGM and FSRBCM can greatly improve the ill-conditioning of the resultant matrix. In conclusion, its advantages on high accuracy; exponential convergence; well-conditioning; and effective computation make the FSRBCM a first-choice among the five radial basis functions methods.

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.