RBF-based meshless boundary knot method and boundary particle method

Computer Science – Computational Engineering – Finance – and Science

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

This paper is concerned with the two new boundary-type radial basis function collocation schemes, boundary knot method (BKM) and boundary particle method (BPM). The BKM is developed based on the dual reciprocity theorem, while the BPM employs the multiple reciprocity technique. Unlike the method of fundamental solution, the wto methods use the nonsingular general solutions instead of singular fundamental solution to circumvent the controversial artificial boundary outside physical domain. Compared with the boundary element method, both the BKM and BPM are meshfree, superconvergent, meshfree, integration free, symmetric, and mathematically simple collocation techniques for general PDEs. In particular, the BPM does not require any inner nodes for inhomogeneous problems. In this study, the accuracy and efficiency of the two methods are numerically demonstrated to some 2D, 3D Helmholtz and convection-diffusion problems under complicated geometries.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

RBF-based meshless boundary knot method and boundary particle method does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with RBF-based meshless boundary knot method and boundary particle method, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and RBF-based meshless boundary knot method and boundary particle method will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-185215

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.