<s>
The	O
generalized-strain	B-Algorithm
mesh-free	I-Algorithm
(	O
GSMF	O
)	O
formulation	O
is	O
a	O
local	O
meshfree	B-Algorithm
method	I-Algorithm
in	O
the	O
field	O
of	O
numerical	B-General_Concept
analysis	I-General_Concept
,	O
completely	O
integration	O
free	O
,	O
working	O
as	O
a	O
weighted-residual	O
weak-form	O
collocation	O
.	O
</s>
<s>
This	O
method	O
was	O
first	O
presented	O
by	O
Oliveira	O
and	O
Portela	O
(	O
2016	O
)	O
,	O
in	O
order	O
to	O
further	O
improve	O
the	O
computational	O
efficiency	O
of	O
meshfree	B-Algorithm
methods	I-Algorithm
in	O
numerical	B-General_Concept
analysis	I-General_Concept
.	O
</s>
<s>
Local	O
meshfree	B-Algorithm
methods	I-Algorithm
are	O
derived	O
through	O
a	O
weighted-residual	O
formulation	O
which	O
leads	O
to	O
a	O
local	O
weak	O
form	O
that	O
is	O
the	O
well	O
known	O
work	O
theorem	O
of	O
the	O
theory	O
of	O
structures	O
.	O
</s>
<s>
Advantages	O
over	O
finite	B-Application
element	I-Application
methods	I-Application
are	O
that	O
GSMF	O
does	O
n't	O
rely	O
on	O
a	O
grid	O
,	O
and	O
is	O
more	O
precise	O
and	O
faster	O
when	O
solving	O
bi-dimensional	O
problems	O
.	O
</s>
<s>
When	O
compared	O
to	O
other	O
meshless	B-Algorithm
methods	I-Algorithm
,	O
such	O
as	O
rigid-body	O
displacement	O
mesh-free	O
(	O
RBDMF	O
)	O
formulation	O
,	O
the	O
element-free	O
Galerkin	O
(	O
EFG	O
)	O
and	O
the	O
meshless	O
local	O
Petrov-Galerkin	O
finite	B-Algorithm
volume	I-Algorithm
method	I-Algorithm
(	O
MLPG	O
FVM	O
)	O
;	O
GSMF	O
proved	O
to	O
be	O
superior	O
not	O
only	O
regarding	O
the	O
computational	O
efficiency	O
,	O
but	O
also	O
regarding	O
the	O
accuracy	O
.	O
</s>
<s>
The	O
moving	B-Algorithm
least	I-Algorithm
squares	I-Algorithm
(	O
MLS	O
)	O
approximation	O
of	O
the	O
elastic	O
field	O
is	O
used	O
on	O
this	O
local	O
meshless	O
formulation	O
.	O
</s>
<s>
This	O
is	O
the	O
equation	O
used	O
in	O
the	O
Generalized-Strain	B-Algorithm
Mesh-Free	I-Algorithm
(	O
GSMF	O
)	O
formulation	O
which	O
,	O
therefore	O
,	O
is	O
free	O
of	O
integration	O
.	O
</s>
