Table of Content

Open Access iconOpen Access

ARTICLE

A New Meshless Interpolation Scheme for MLPG_R Method

Q.W. Ma1

School of Engineering and Mathematical Sciences, City University, Northampton Square, London, UK, EC1V0HB

Computer Modeling in Engineering & Sciences 2008, 23(2), 75-90. https://doi.org/10.3970/cmes.2008.023.075

Abstract

In the MLPG_R (Meshless Local Petrove-Galerkin based on Rankine source solution) method, one needs a meshless interpolation scheme for an unknown function to discretise the governing equation. The MLS (moving least square) method has been used for this purpose so far. The MLS method requires inverse of matrix or solution of a linear algebraic system and so is quite time-consuming. In this paper, a new scheme, called simplified finite difference interpolation (SFDI), is devised. This scheme is generally as accurate as the MLS method but does not need matrix inverse and consume less CPU time to evaluate. Although this scheme is purposely developed for the MLPG_R method, it may also be used for other meshless methods.

Keywords


Cite This Article

APA Style
Ma, Q. (2008). A new meshless interpolation scheme for MLPG_R method. Computer Modeling in Engineering & Sciences, 23(2), 75-90. https://doi.org/10.3970/cmes.2008.023.075
Vancouver Style
Ma Q. A new meshless interpolation scheme for MLPG_R method. Comput Model Eng Sci. 2008;23(2):75-90 https://doi.org/10.3970/cmes.2008.023.075
IEEE Style
Q. Ma, “A New Meshless Interpolation Scheme for MLPG_R Method,” Comput. Model. Eng. Sci., vol. 23, no. 2, pp. 75-90, 2008. https://doi.org/10.3970/cmes.2008.023.075



cc Copyright © 2008 The Author(s). Published by Tech Science Press.
This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 2595

    View

  • 1186

    Download

  • 0

    Like

Share Link