264 5 General Aspects of HTSC Modeling
In order to compute L, we use a presentation about crack path as on the
graph branch, joining the points at the opposite sides of the model layer. In
this case, the graph branches are constructed, taking into account the inter-
granular boundary lattice. The beginning of the graph tree coincides with
the intersection point of one from intergranular boundaries with the left side
of the sample (see Fig. 5.26). This selection of the crack growth beginning
corresponds to test data, showing that usually a fracture starts from sample
surface. It is clear that a set of the graph tree branches may be selected,
connecting a given point at one side of the layer with arbitrary point at the
opposite side. From the energy minimum condition, a minimum trajectory
corresponds to actual crack path. In order to define this minimum path, the
Bellman-Kalaba’s algorithm is used [562]. In this case, a problem of minimiza-
tion of the numerical (n + 1)-order graph with tips, x
i
, is reduced to solution
of the next equation set:
V
i
=min(V
j
+ C
ij
),i=0, 1 ...,n− 1; j =0, 1 ...,n; i = j
V
n
=0
, (5.92)
where V
i
is the length of optimum path between points of x
n
and x
i
; C
ij
≥ 0
is the value corresponding to the graph arc (x
i
,x
j
). The Bellman-Kalaba’s
algorithm suggests an iteration method for the solution of the minimization
problem (5.92). Supposing V
(0)
i
= C
in
; i =0, 1 ...,n−1; V
(0)
n
= 0, successively
compute
V
(1)
i
=min(V
(0)
j
+ C
ij
); i =0, 1 ...,n− 1; j =0, 1 ...,n; i = j
.........................................................................................
V
(k)
i
=min(V
(k−1)
j
+ C
ij
); i =0, 1 ...,n− 1; j =0, 1 ...,n; i = j
.........................................................................................
V
(k)
n
= 0 (5.93)
up to carrying out of the equalities, V
(k)
i
= V
(k−1)
i
; i =0, 1 ...,n−1. In this
case, the values of V
(k)
i
are the minimum values, which define an optimum
branch of the graph tree. (n−1) iterations are sufficient for its determination.
In the considered case, the graph tips coincide with the lattice nodes dis-
posed in intergranular boundaries. In order to accelerate a sorting out of pos-
sible graph branches, Viterbi’s algorithm is used [72]. Only the graph branches
with length, which is not longer than a given inter-nodal distance, l
j
(or length
of the crack unit jump), are considered. If these paths are to be more than one,
a priority is given to the path with the final tip disposed from the initial one
at maximum distance along the coordinate perpendicular to tensile direction.
The final graph tip, found in this way, corresponds to the crack tip after its
jump; at the same time, this tip is assumed to be initial for the next graph tree,
and so on. In order to optimize the selection process, it is expedient to limit a