<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns="http://purl.org/rss/1.0/" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel rdf:about="http://repositorio.ufc.br/handle/riufc/48297">
    <title>DSpace Coleção:</title>
    <link>http://repositorio.ufc.br/handle/riufc/48297</link>
    <description />
    <items>
      <rdf:Seq>
        <rdf:li rdf:resource="http://repositorio.ufc.br/handle/riufc/48390" />
      </rdf:Seq>
    </items>
    <dc:date>2026-04-18T00:05:44Z</dc:date>
  </channel>
  <item rdf:about="http://repositorio.ufc.br/handle/riufc/48390">
    <title>A one-dimensional least-square-consistent displacement-based meshless local Petrov-Galerkin method</title>
    <link>http://repositorio.ufc.br/handle/riufc/48390</link>
    <description>Tí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&#xD;
many researchers in solving several types of boundary value problems. This method is based on a local&#xD;
weak form, evaluated in local subdomains and does not require any mesh, either in the construction of the&#xD;
test and shape functions or in the integration process. However, the shape functions used in MLPG have&#xD;
complicated forms, which makes their computation and their derivative’s computation costly. In this&#xD;
work, using the Moving Least Square (MLS) Method, we dissociate the point where the approximating&#xD;
polynomial’s coefficients are optimized, from the points where its derivatives are computed. We argue&#xD;
that this approach not only is consistent with the underlying approximation hypothesis, but also makes&#xD;
computation of derivatives simpler. We apply our approach to a two-point boundary value problem,&#xD;
and perform several tests to support our claim. The results show that the proposed model is efficient,&#xD;
achieves good precision, and is attractive to be applied to other higher-dimension problems.
Tipo: Relatório</description>
    <dc:date>2019-01-01T00:00:00Z</dc:date>
  </item>
</rdf:RDF>

