DSpace Coleção:http://repositorio.ufc.br/handle/riufc/482972026-04-19T07:23:13Z2026-04-19T07:23:13ZA one-dimensional least-square-consistent displacement-based meshless local Petrov-Galerkin methodSousa, Laise Lima de CarvalhoOliveira, Suzana Matos França deVidal, Creto AugustoCavalcante Neto, Joaquim Bentohttp://repositorio.ufc.br/handle/riufc/483902019-12-11T19:33:58Z2019-01-01T00:00:00ZTítulo: A one-dimensional least-square-consistent displacement-based meshless local Petrov-Galerkin method
Autor(es): Sousa, Laise Lima de Carvalho; Oliveira, Suzana Matos França de; Vidal, Creto Augusto; Cavalcante Neto, Joaquim Bento
Abstract: In recent years, the Meshless Local Petrov-Galerkin (MLPG) Method has attracted the attention of
many researchers in solving several types of boundary value problems. This method is based on a local
weak form, evaluated in local subdomains and does not require any mesh, either in the construction of the
test and shape functions or in the integration process. However, the shape functions used in MLPG have
complicated forms, which makes their computation and their derivative’s computation costly. In this
work, using the Moving Least Square (MLS) Method, we dissociate the point where the approximating
polynomial’s coefficients are optimized, from the points where its derivatives are computed. We argue
that this approach not only is consistent with the underlying approximation hypothesis, but also makes
computation of derivatives simpler. We apply our approach to a two-point boundary value problem,
and perform several tests to support our claim. The results show that the proposed model is efficient,
achieves good precision, and is attractive to be applied to other higher-dimension problems.
Tipo: Relatório2019-01-01T00:00:00Z