Annamaria Mazzia1, Giorgio Pini1, Flavio Sartoretto2
CMES-Computer Modeling in Engineering & Sciences, Vol.102, No.6, pp. 475-497, 2014, DOI:10.3970/cmes.2014.102.475
Abstract Meshless Local Petrov Galerkin (MLPG) methods are pure meshless techniques for solving Partial Differential Equations. One of pure meshless methods main applications is for implementing Adaptive Discretization Techniques. In this paper, we describe our fresh node–wise refinement technique, based upon estimations of the “local” Total Variation of the approximating function. We numerically analyze the accuracy and efficiency of our MLPG–based refinement. Solutions to test Poisson problems are approximated, which undergo large variations inside small portions of the domain. We show that 2D problems can be accurately solved. The gain in accuracy with respect to uniform More >
Login
Register
