<s>
The	O
FETI-DP	B-Algorithm
method	O
is	O
a	O
domain	B-Algorithm
decomposition	I-Algorithm
method	I-Algorithm
that	O
enforces	O
equality	O
of	O
the	O
solution	O
at	O
subdomain	O
interfaces	O
by	O
Lagrange	O
multipliers	O
except	O
at	O
subdomain	O
corners	O
,	O
which	O
remain	O
primal	O
variables	O
.	O
</s>
<s>
FETI-DP	B-Algorithm
is	O
a	O
simplification	O
and	O
a	O
better	O
performing	O
version	O
of	O
FETI	B-Algorithm
.	O
</s>
<s>
The	O
eigenvalues	O
of	O
FETI-DP	B-Algorithm
are	O
same	O
as	O
those	O
of	O
BDDC	B-Algorithm
,	O
except	O
for	O
the	O
eigenvalue	O
equal	O
to	O
one	O
,	O
and	O
so	O
the	O
performance	O
of	O
FETI-DP	B-Algorithm
and	O
BDDC	B-Algorithm
is	O
essentially	O
same	O
.	O
</s>
<s>
FETI-DP	B-Algorithm
methods	O
are	O
very	O
suitable	O
for	O
high	O
performance	O
parallel	O
computing	O
.	O
</s>
<s>
A	O
structural	O
simulation	O
using	O
a	O
FETI-DP	B-Algorithm
algorithm	O
and	O
running	O
on	O
3783	O
processors	O
of	O
the	O
ASCI	O
White	O
supercomputer	O
was	O
awarded	O
a	O
Gordon	O
Bell	O
prize	O
in	O
2002	O
.	O
</s>
<s>
A	O
recent	O
FETI-DP	B-Algorithm
method	O
has	O
scaled	O
to	O
more	O
than	O
65000	O
processor	O
cores	O
of	O
the	O
JUGENE	O
supercomputer	O
solving	O
a	O
model	O
problem	O
.	O
</s>
