Method of fundamental solutions

Consider a partial differential equation governing certain type of problems

${\displaystyle Lu=f\left(x,y\right),\ \ \left(x,y\right)\in \Omega ,}$

${\displaystyle u=g\left(x,y\right),\ \ \left(x,y\right)\in \partial \Omega _{D},}$

${\displaystyle {\frac {\partial u}{\partial n}}=h\left(x,y\right),\ \ \left(x,y\right)\in \partial \Omega _{N},}$

where ${\displaystyle L}$ is the differential partial operator, ${\displaystyle \Omega }$ represents the computational domain, ${\displaystyle \partial \Omega _{D}}$ and ${\displaystyle \partial \Omega _{N}}$ denote the Dirichlet and Neumann boundary, respectively, ${\displaystyle \partial \Omega _{D}\cup \partial \Omega _{N}=\partial \Omega }$ and ${\displaystyle \partial \Omega _{D}\cap \partial \Omega _{N}=\varnothing }$.

The MFS employs the fundamental solution of the operator as its basis function to represent the approximation of unknown function u as follows

${\displaystyle {{u}^{*}}\left(x,y\right)=\sum \limits _{i=1}^{N}\alpha _{i}\phi \left(r_{i}\right)}$

where ${\displaystyle r_{i}=\left\|\left(x,y\right)-\left(sx_{i},sy_{i}\right)\right\|}$ denotes the Euclidean distance between collocation points ${\displaystyle \left(x,y\right)}$ and source points ${\displaystyle \left(sx_{i},sy_{i}\right)}$, ${\displaystyle \phi \left(\cdot \right)}$ is the fundamental solution which satisfies

${\displaystyle L\phi =\delta \,}$

where ${\displaystyle \delta }$ denotes Dirac delta function, and ${\displaystyle {{\alpha }_{i}}}$ are the unknown coefficients.

With the source points located outside the physical domain, the MFS avoid the fundamental solution singularity. Substituting the approximation into boundary condition yields the following matrix equation

${\displaystyle \left[{\begin{matrix}\phi \left(\left.r_{j}\right|_{x_{i},y_{i}}\right)\\{\frac {\partial \phi \left(\left.r_{j}\right|_{x_{k},y_{k}}\right)}{\partial n}}\\\end{matrix}}\right]\ \cdot \ \alpha =\left({\begin{matrix}g\left(x_{i},y_{i}\right)\\h\left(x_{k},y_{k}\right)\\\end{matrix}}\right),}$

where ${\displaystyle \left(x_{i},y_{i}\right)}$ and ${\displaystyle \left(x_{k},y_{k}\right)}$ denote the collocation points, respectively, on Dirichlet and Neumann boundaries. The unknown coefficients ${\displaystyle \alpha _{i}}$ can uniquely be determined by the above algebraic equation. And then we can evaluate numerical solution at any location in physical domain.

The ideas behind the MFS were developed primarily by V. D. Kupradze and M. A. Alexidze in the late 1950s and early 1960s.[1] However, the method was first proposed as a computational technique much later by R. Mathon and R. L. Johnston in the late 1970s,[2] followed by a number of papers by Mathon, Johnston and Graeme Fairweather with applications. The MFS then gradually became a useful tool for the solution of a large variety of physical and engineering problems.[3][4][5][6]

In the 1990s, M. A. Golberg and C. S. Chen extended the MFS to deal with inhomogeneous equations and time-dependent problems, greatly expanding its applicability.[7][8] Later developments indicated that the MFS can be used to solve partial differential equations with variable coefficients.[9] The MFS has proved particularly effective for certain classes of problems such as inverse,[10] unbounded domain, and free-boundary problems.[11]

Some techniques have been developed to cure the fictitious boundary problem in the MFS, such as the boundary knot method, singular boundary method, and regularized meshless method.

• Radial basis function
• Boundary element method
• Boundary knot method
• Boundary particle method
• Singular boundary method
• Regularized meshless method

• International Center for Numerical Simulation Software in Engineering & Sciences