<s>
Dynamic	B-Algorithm
relaxation	I-Algorithm
is	O
a	O
numerical	O
method	O
,	O
which	O
,	O
among	O
other	O
things	O
,	O
can	O
be	O
used	O
to	O
do	O
"	O
form-finding	O
"	O
for	O
cable	O
and	O
fabric	O
structures	O
.	O
</s>
<s>
The	O
dynamic	B-Algorithm
relaxation	I-Algorithm
method	O
is	O
based	O
on	O
discretizing	O
the	O
continuum	O
under	O
consideration	O
by	O
lumping	O
the	O
mass	O
at	O
nodes	O
and	O
defining	O
the	O
relationship	O
between	O
nodes	O
in	O
terms	O
of	O
stiffness	O
(	O
see	O
also	O
the	O
finite	B-Application
element	I-Application
method	I-Application
)	O
.	O
</s>
<s>
An	O
iterative	O
process	O
is	O
followed	O
by	O
simulating	O
a	O
pseudo-dynamic	O
process	O
in	O
time	O
,	O
with	O
each	O
iteration	O
based	O
on	O
an	O
update	O
of	O
the	O
geometry	O
,	O
similar	O
to	O
Leapfrog	B-Algorithm
integration	I-Algorithm
and	O
related	O
to	O
Velocity	O
Verlet	B-Language
integration	I-Language
.	O
</s>
<s>
The	O
relationship	O
between	O
the	O
speed	O
,	O
the	O
geometry	O
and	O
the	O
residuals	O
can	O
be	O
obtained	O
by	O
performing	O
a	O
double	O
numerical	O
integration	O
of	O
the	O
acceleration	O
(	O
here	O
in	O
central	B-Algorithm
finite	I-Algorithm
difference	I-Algorithm
form	O
)	O
,	O
:	O
</s>
<s>
It	O
is	O
possible	O
to	O
make	O
dynamic	B-Algorithm
relaxation	I-Algorithm
more	O
computationally	O
efficient	O
(	O
reducing	O
the	O
number	O
of	O
iterations	O
)	O
by	O
using	O
damping	O
.	O
</s>
