New advances in dual reciprocity and boundary-only RBF methods
W. Chen, M. Tanaka

TL;DR
This paper introduces significant advances in dual reciprocity and boundary-only RBF methods, notably the boundary knot method (BKM), which is meshless, integration-free, and capable of handling nonlinear PDEs efficiently.
Contribution
It proposes the boundary knot method (BKM) as a novel, meshless, symmetric, and integration-free boundary-only technique, and develops a general RBF methodology based on Green's identity for improved efficiency.
Findings
BKM is meshless and exponential convergent.
BKM can formulate linear models for nonlinear PDEs.
The GSR approach links BEM and RBFs explicitly.
Abstract
This paper made some significant advances in the dual reciprocity and boundary-only RBF techniques. The proposed boundary knot method (BKM) is different from the standard boundary element method in a number of important aspects. Namely, it is truly meshless, exponential convergence, integration-free (of course, no singular integration), boundary-only for general problems, and leads to symmetric matrix under certain conditions (able to be extended to general cases after further modified). The BKM also avoids the artificial boundary in the method of fundamental solution. An amazing finding is that the BKM can formulate linear modeling equations for nonlinear partial differential systems with linear boundary conditions. This merit makes it circumvent all perplexing issues in the iteration solution of nonlinear equations. On the other hand, by analogy with Green's second identity, this…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNumerical methods in engineering · Advanced Numerical Methods in Computational Mathematics · Electromagnetic Simulation and Numerical Methods
