Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (1)
  • Open Access


    A DMLPG Refinement Technique for 2D and 3D Potential Problems

    Annamaria Mazzia1, Giorgio Pini1, Flavio Sartoretto2

    CMES-Computer Modeling in Engineering & Sciences, Vol.108, No.4, pp. 239-262, 2015, DOI:10.3970/cmes.2015.108.239

    Abstract Meshless Local Petrov Galerkin (MLPG) methods are pure meshless techniques for solving Partial Differential Equations (PDE). MLPG techniques are nowadays used for solving a huge number of complex, real–life problems. While MLPG aims to approximate the solution of a given differential problem, its “dual” Direct MLPG (DMLPG) technique relies upon approximating linear functionals. Assume adaptive methods are to be implemented. When using a mesh–based method, inserting and/or deleting a node implies complex adjustment of connections. Meshless methods are more apt to implement adaptivity, since they does not require such adjustments. Nevertheless, ad–hoc insertion and/or deletion algorithms must be devised, in… More >

Displaying 1-10 on page 1 of 1. Per Page