Next: Concluding remarks
Up: Numerical examples
Previous: One pennyshaped crack
We now consider an infinite space which contains an
array of pennyshaped cracks, each having the same radius a_{0},
subjected to the same asymptotic condition as in the previous
example. The centroids of these cracks are located at the same interval
of 4a_{0} in each coordinate direction, but the direction of each crack
is taken random. First, we consider an array of
pennyshaped cracks in the infinite
domain. Fig.4.10 plots the total CPU time (sec)
required by the original FMBIEM and the new FMBIEM with this array. In
Fig.4.10 the lines marked `Tfmm' and `Tfmmnew'
indicate the CPU times required with the original FMBIEM and the new
FMBIEM, respectively. Next we consider an infinite space which
contains an array of
pennyshaped cracks
(total DOF=1,285,632) in the infinite domain. Fig.4.11
plots the nondimensional crack opening displacement (
)
on the nondimensional mesh
.
The
required CPU times with the original FMBIEM and the new FMBIEM are
13954(sec) and 8290(sec), respectively. In this example the error
defined as
is
,
where
is the numerical
solution obtained with the new FMBIEM,
the one obtained with
the original FMBIEM and
denotes the L_{2}norm. These
results show that the new FMBIEM is more efficient than the original
FMBIEM when distribution of the boundary elements is dense in the
domain.
Figure 4.8:
Crack opening displacement

Figure 4.9:
CPU time (sec)

Figure 4.10:
CPU time (sec)

Figure 4.11:
Crack opening displacement (DOF=1,285,632)

Next: Concluding remarks
Up: Numerical examples
Previous: One pennyshaped crack
Kenichi Yoshida
20010728