In scientific computation and simulation, the method of fundamental solutions (MFS) is a technique for solving partial differential equations based on using the fundamental solution as a basis function. The MFS was developed to overcome the major drawbacks in the boundary element method (BEM) which also uses the fundamental solution to satisfy the governing equation. Consequently, both the MFS and the BEM are of a boundary discretization numerical technique and reduce the computational complexity by one dimensionality and have particular edge over the domain-type numerical techniques such as the finite element and finite volume methods on the solution of infinite domain, thin-walled structures, and inverse problems.
In contrast to the BEM, the MFS avoids the numerical integration of singular fundamental solution and is an inherent meshfree method. The method, however, is compromised by requiring a controversial fictitious boundary outside the physical domain to circumvent the singularity of fundamental solution, which has seriously restricted its applicability to real-world problems. But nevertheless the MFS has been found very competitive to some application areas such as infinite domain problems.
The MFS is also known by quite a few different names in the literature. Among these are the charge simulation method, the superposition method, the desingularized method, the indirect boundary element method, and the virtual boundary element method, just to name a few.
Consider a partial differential equation governing certain type of problems
where is the differential partial operator, represents the computational domain, and denote the Dirichlet and Neumann boundary, respectively, and .
The MFS employs the fundamental solution of the operator as its basis function to represent the approximation of unknown function u as follows
where denotes the Euclidean distance between collocation points and source points , is the fundamental solution which satisfies
where denotes Dirac delta function, and 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
where and denote the collocation points, respectively, on Dirichlet and Neumann boundaries. The unknown coefficients 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.
The wave equation is an important second-order linear partial differential equation for the description of waves—as they occur in classical physics—such as mechanical waves or light waves. It arises in fields like acoustics, electromagnetics, and fluid dynamics.
In physics, the Navier–Stokes equations, named after Claude-Louis Navier and George Gabriel Stokes, describe the motion of viscous fluid substances.
In physics and mathematics, the heat equation is a partial differential equation that describes how the distribution of some quantity evolves over time in a solid medium, as it spontaneously flows from places where it is higher towards places where it is lower. It is a special case of the diffusion equation.
The Rayleigh–Ritz method is a numerical method of finding approximations to eigenvalue equations that are difficult to solve analytically, particularly in the context of solving physical boundary value problems that can be expressed as matrix differential equations. It is used in mechanical engineering to approximate the eigenmodes of a physical system, such as finding the resonant frequencies of a structure to guide appropriate damping. The name is a common misnomer used to describe the method that is more appropriately termed the Ritz method or the Galerkin method. This method was invented by Walther Ritz in 1909, but it bears some similarity to the Rayleigh quotient and so the misnomer persists.
In the mathematical study of heat conduction and diffusion, a heat kernel is the fundamental solution to the heat equation on a specified domain with appropriate boundary conditions. It is also one of the main tools in the study of the spectrum of the Laplace operator, and is thus of some auxiliary importance throughout mathematical physics. The heat kernel represents the evolution of temperature in a region whose boundary is held fixed at a particular temperature, such that an initial unit of heat energy is placed at a point at time t = 0.
A perfectly matched layer (PML) is an artificial absorbing layer for wave equations, commonly used to truncate computational regions in numerical methods to simulate problems with open boundaries, especially in the FDTD and FE methods. The key property of a PML that distinguishes it from an ordinary absorbing material is that it is designed so that waves incident upon the PML from a non-PML medium do not reflect at the interface—this property allows the PML to strongly absorb outgoing waves from the interior of a computational region without reflecting them back into the interior.
In the field of numerical analysis, meshfree methods are those that do not require connection between nodes of the simulation domain, i.e. a mesh, but are rather based on interaction of each node with all its neighbors. As a consequence, original extensive properties such as mass or kinetic energy are no longer assigned to mesh elements but rather to the single nodes. Meshfree methods enable the simulation of some otherwise difficult types of problems, at the cost of extra computing time and programming effort. The absence of a mesh allows Lagrangian simulations, in which the nodes can move according to the velocity field.
In mathematics, an elliptic boundary value problem is a special kind of boundary value problem which can be thought of as the stable state of an evolution problem. For example, the Dirichlet problem for the Laplacian gives the eventual distribution of heat in a room several hours after the heating is turned on.
In applied mathematics, discontinuous Galerkin methods form a class of numerical methods for solving differential equations. They combine features of the finite element and the finite volume framework and have been successfully applied to hyperbolic, elliptic, parabolic and mixed form problems arising from a wide range of applications. DG methods have in particular received considerable interest for problems with a dominant first-order part, e.g. in electrodynamics, fluid mechanics and plasma physics.
The finite element method (FEM) is the most largely used method for solving problems of engineering and mathematical models. Typical problem areas of interest include the traditional fields of structural analysis, heat transfer, fluid flow, mass transport, and electromagnetic potential. It is in fact a particular numerical method for solving partial differential equations in two or three space variables. To solve the problem, it subdivides a large system into smaller, simpler parts that are called finite elements. This is obtained by a particular space discretisation in the space dimensions, which brings to the construction of a mesh of the object: the numerical domain for the solution, which has a finite number of points. The finite element method formulation of a boundary value problem finally brings to a system of algebraic equations. The method approximates the unknown function over the domain. The simple equations that model these finite elements are then assembled into a larger system of equations that models the entire problem. FEM then uses variational methods from the calculus of variations to approximate a solution by minimizing an associated error function.
In the finite element method for the numerical solution of elliptic partial differential equations, the stiffness matrix represents the system of linear equations that must be solved in order to ascertain an approximate solution to the differential equation.
The narrow escape problem is a ubiquitous problem in biology, biophysics and cellular biology.
In mathematics, the Fictitious domain method is a method to find the solution of a partial differential equations on a complicated domain , by substituting a given problem posed on a domain , with a new problem posed on a simple domain containing .
In numerical analysis, the singular boundary method (SBM) belongs to a family of meshless boundary collocation techniques which include the method of fundamental solutions (MFS), boundary knot method (BKM), regularized meshless method (RMM), boundary particle method (BPM), modified MFS, and so on. This family of strong-form collocation methods is designed to avoid singular numerical integration and mesh generation in the traditional boundary element method (BEM) in the numerical solution of boundary value problems with boundary nodes, in which a fundamental solution of the governing equation is explicitly known.
In numerical mathematics, the boundary knot method (BKM) is proposed as an alternative boundary-type meshfree distance function collocation scheme.
In numerical mathematics, the regularized meshless method (RMM), also known as the singular meshless method or desingularized meshless method, is a meshless boundary collocation method designed to solve certain partial differential equations whose fundamental solution is explicitly known. The RMM is a strong-form collocation method with merits being meshless, integration-free, easy-to-implement, and high stability. Until now this method has been successfully applied to some typical problems, such as potential, acoustics, water wave, and inverse problems of bounded and unbounded domains.
The Kansa method is a computer method used to solve partial differential equations. Partial differential equations are mathematical models of things like stresses in a car's body, air flow around a wing, the shock wave in front of a supersonic airplane, quantum mechanical model of an atom, ocean waves, socio-economic models, digital image processing etc. The computer takes the known quantities such as pressure, temperature, air velocity, stress, and then uses the laws of physics to figure out what the rest of the quantities should be like a puzzle being fit together. Then, for example, the stresses in various parts of a car can be determined when that car hits a bump at 70 miles per hour.
In mathematics, Sobolev spaces for planar domains are one of the principal techniques used in the theory of partial differential equations for solving the Dirichlet and Neumann boundary value problems for the Laplacian in a bounded domain in the plane with smooth boundary. The methods use the theory of bounded operators on Hilbert space. They can be used to deduce regularity properties of solutions and to solve the corresponding eigenvalue problems.
The generalized-strain mesh-free (GSMF) formulation is a local meshfree method in the field of numerical analysis, completely integration free, working as a weighted-residual weak-form collocation. This method was first presented by Oliveira and Portela (2016), in order to further improve the computational efficiency of meshfree methods in numerical analysis. Local meshfree methods are derived through a weighted-residual formulation which leads to a local weak form that is the well known work theorem of the theory of structures. In an arbitrary local region, the work theorem establishes an energy relationship between a statically-admissible stress field and an independent kinematically-admissible strain field. Based on the independence of these two fields, this formulation results in a local form of the work theorem that is reduced to regular boundary terms only, integration-free and free of volumetric locking.
The Fokas method, or unified transform, is an algorithmic procedure for analysing boundary value problems for linear partial differential equations and for an important class of nonlinear PDEs belonging to the so-called integrable systems. It is named after Greek mathematician Athanassios S. Fokas.