Kansa method

The Kansa method, also called modified MQ scheme or MQ collocation method, originated from the well-known MQ interpolation. The efficiency and applicability of this method have been verified in a wide range of problems. Compared with the boundary-type RBF collocation methods, the Kansa method has wider applicability to problems whose fundamental and general solutions are not available, e.g., varying coefficient and nonlinear problems.

Let d-dimensional physical domain ${\displaystyle \Omega \subseteq \mathbb {R} ^{d}}$ and consider the following boundary value problem (BVP)

${\displaystyle {\begin{aligned}Lu(X)&=f(X),\quad X\in \Omega ,&&(1)\\[4pt]u(X)&=g(X),\quad X\in \partial \Omega _{D},&&(2)\\[4pt]{\frac {\partial u(X)}{\partial n}}&=h(X),\quad X\in \partial \Omega _{N},&&(3)\end{aligned}}}$

where L represents a differential operator and d is the dimensionality of the problem, ${\displaystyle \partial \Omega _{D},\,\partial \Omega _{N}}$ denote the Dirichlet and Neumann boundaries, respectively, and ${\displaystyle \partial \Omega _{D}\cup \partial \Omega _{N}=\partial \Omega }$. The Kansa method approximates the desired function by a linear combination of the RBF in the form:

${\displaystyle u(X)^{*}=\sum _{i=1}^{N}\alpha _{i}\varphi (r_{i}),\qquad (4)}$

where ${\displaystyle \alpha _{i}}$ is the coefficients to be determined, ${\displaystyle \varphi (r_{i})}$ denotes the RBF such as the MQ.

In order to guarantee the uniqueness of the solution, a polynomial term may be added as follows:

${\displaystyle u(X)^{*}=\sum _{i=1}^{N}\alpha _{i}\varphi (r_{i})+\sum _{k=1}^{M}\alpha _{k+N}\gamma _{k}(X),\qquad (5)}$

where ${\displaystyle \gamma _{k}(X)}$ is the polynomial. The RBF interpolation (4) and (5) are both often used in practice. Mathematicians prefer the latter for its rigorous and solid theoretical foundation, while engineering users often employ the former since it is easier and simpler and produces the sound results in the majority of cases. Substituting Eq. (4) or (5) into Eqs. (1–3) yields the resulting algebraic equation system:

${\displaystyle \mathbf {A} \alpha =b,\qquad (6)}$

where

${\displaystyle \mathbf {A} =\left({\begin{matrix}L(\varphi )&L(\gamma )\\[5pt]\varphi &\gamma \\[8pt]{\dfrac {\partial \varphi }{\partial n}}&{\dfrac {\partial \gamma }{\partial n}}\\[8pt]\gamma &0\end{matrix}}\right),\quad \mathbf {b} =\left({\begin{matrix}f\\g\\h\\0\end{matrix}}\right),\quad \varphi =\varphi (x_{i},x_{j}),\quad \gamma =\gamma _{k}(X_{i}).\qquad (7)}$

After expansion coefficients ${\displaystyle \alpha _{i}}$ are evaluated, the desired function can be calculated from Eq. (4) or (5).

Numerical solutions of PDEs are usually obtained through the finite difference method (FDM), the finite element method (FEM) or boundary element method (BEM). It is known that the FDM is difficult to model an irregular domain for the reason that it usually requires a rectangular grid system. Although the FEM can accommodate a more flexible framework, the meshing and remeshing are not trivial. The BEM is an alternative method in some engineering problems, such as inverse, unbounded domain, and thin-walled structure problems. However, its applications are largely limited by the availability of the fundamental solution of the governing equation.

In the recent several decades, “meshless” or “element-free” methods attract great attention. The driving force behind the scene is that the mesh-based methods such as the standard FEM and BEM require prohibitively computational effort in handling high-dimensional, moving, and complex-shaped boundary problems. The Kansa method [1][2] directly collocates the RBFs, especially the MQ, at the nodes without the need of mesh or elements and therefore is an inherently truly meshless method.

Despite great effort, the rigorous mathematical proof of the solvability of the Kansa method is still missing.[3] In addition, the mixed boundary conditions also destroy the symmetry of its interpolation matrix. Refs.[4][5] propose the symmetric Hermite RBF collocation scheme with sound mathematical analysis of solvability. One common issue in the Kansa method and symmetric Hermite method, however, is that the numerical solutions at nodes adjacent to boundary deteriorate by one to two orders of magnitude compared with those in central region. The PDE collocation on the boundary (PDECB) [6] effectively remove this shortcoming. However, this strategy requires an additional set of nodes inside or outside of the domain adjacent to the boundary. The arbitrary placing of these additional nodes gives rise to troublesome issues in the simulation of complex and multiply-connected domain problems. The PDECB also lacks explicit theoretical endorsement. In fact, a similar strategy has also been proposed,[7] which collocates both governing and boundary equations on the same boundary nodes. However, the method is unsymmetrical and still lacks explicit theoretical foundation. By using the Green second identity, the modified Kansa method [8][9] is devised to remedy all weaknesses aforementioned. For the MQ, its shape parameter largely determines its interpolation error. There exist a number of mathematical theories concerning the family of multiquadric radial basis functions and providing some suggestions on the choice of the shape parameter.[10][11][12][13]

The Kansa method are widely been applied in computational sciences. In,[1] the Kansa method is employed to address the parabolic, hyperbolic and elliptic partial differential equations. Kansa method has recently been extended to various ordinary and PDEs including the bi-phasic and triphasic mixture models of tissue engineering problems,[14][15] 1D nonlinear Burger's equation[16] with shock wave, shallow water equations [17] for tide and current simulation, heat transfer problems,[18] free boundary problems,[19] and fractional diffusion equations.[20]

• Radial basis function
• Method of fundamental solutions
• Boundary knot method
• Boundary particle method
• Singular boundary method

• Modified Kansa method