“School of Mathematics”

Back to Papers Home
Back to Papers of School of Mathematics

Paper   IPM / M / 14295
School of Mathematics
  Title:   A greedy meshless local Petrov-Galerkin method based on radical basis functions
  Author(s):  D. Mirzaei
  Status:   Published
  Journal: Numer. Methods Partial Differential Eq.
  Vol.:  32
  Year:  2016
  Pages:   447-461
  Supported by:  IPM
The meshless local Petrov–Galerkin (MLPG) method with global radial basis functions (RBF) as trial approximation leads to a full final linear system and a large condition number. This makes MLPG less efficient when the number of data points is increased. We can overcome this drawback if we avoid using more points from the data site than absolutely necessary. In this article, we equip the MLPG method with the greedy sparse approximation technique of (Schaback, Numercail Algorithms 67 (2014), 531–547) and use it for numerical solution of partial differential equations. This scheme uses as few neighbor nodal values as possible and allows to control the consistency error by explicit calculation. Whatever the given RBF is, the final system is sparse and the algorithm is well‐conditioned.

Download TeX format
back to top
scroll left or right