21.02.2014 Views

r - The Hong Kong Polytechnic University

r - The Hong Kong Polytechnic University

r - The Hong Kong Polytechnic University

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

programming problems (the surface traction is omitted)<br />

*<br />

λ = min D ε&<br />

dV<br />

∫<br />

∫<br />

V<br />

( )<br />

T *<br />

st .. f u dV = 1<br />

V<br />

(5)<br />

* 1 * *<br />

ε&<br />

= ( ∇ u + u ∇)<br />

in V<br />

2<br />

*<br />

u = u<br />

on Γu<br />

From the optimum of limit loading multiplier λ opt , the limit loading can be computed according to the following<br />

equation:<br />

f = λ ⋅f (6)<br />

lim<br />

opt<br />

Nonlinear optimization problems for the plane strain von-Mises yield criterion<br />

In general, the slope stability problems are treated as the plain strain problems in geotechnical engineering. For<br />

the plain strain condition, the von-Mises (or Tresca) yield criterion can be written as (Pastor, 2000)<br />

f ( σ ) =<br />

1<br />

( ) 2 2<br />

σx − σ<br />

y<br />

+ τxy<br />

− c = 0<br />

4<br />

(7)<br />

where c is the cohesion. According to the associated flow rule, the power of dissipation can be formulated as a<br />

function of strain rates as (Capsoni and Corradi, 1997)<br />

D ( ε& ) =<br />

T<br />

ε& Θε& (8)<br />

where<br />

2 2<br />

⎡ c −c<br />

0 ⎤<br />

⎢ 2 2 ⎥<br />

Θ = ⎢ −c<br />

c 0 ⎥<br />

(9)<br />

⎢<br />

2<br />

0 0 c ⎥<br />

⎣<br />

⎦<br />

<strong>The</strong>refore, the mathematical programming problem (5) of finding the upper bound solution of limit loading<br />

multiplier can be formulated as the following nonlinear optimization problem:<br />

T<br />

λ = min εΘε & & dV<br />

V<br />

T *<br />

.. ∫ f u dV = 1<br />

V<br />

st<br />

∫<br />

* 1 * *<br />

ε&<br />

= ( ∇ u + u ∇)<br />

2<br />

in V<br />

*<br />

u = u<br />

on Γ<br />

Radial point interpolation method<br />

u<br />

<strong>The</strong> approximation of the field variables of interest x using radial point interpolation method (RPIM) can be<br />

expressed in the following form (Liu and Gu, 2005):<br />

T<br />

T<br />

−1<br />

⎧Us<br />

⎫<br />

u( x)<br />

= ⎡<br />

⎣Rq ( x) Pm ( x) ⎤<br />

⎦G ⎨ ⎬=<br />

Φ( x)<br />

Us<br />

(7)<br />

⎩ 0 ⎭<br />

where u(x) is the function of field variables, U s ={u 1 , u 2 , …, u n } T is the vector of function values, Ф(x) is the<br />

RPIM shape functions corresponding to the nodal value and given by<br />

Φ ( x T<br />

T<br />

−1<br />

) = ⎣<br />

⎡ R ( x ) P q m ( x ) ⎤<br />

⎦ G = ⎡⎣φ1( x ) φ2( x ) L φn( x ) ⎤⎦<br />

(8)<br />

in which, R q is the moment matrix of the radial basis function (RBF) given by<br />

⎡R1( x1) R2( x1) L Rn<br />

( x1)<br />

⎤<br />

⎢<br />

⎥<br />

⎢<br />

R1( x2) R2( x2) L Rn<br />

( x2)<br />

R<br />

q<br />

= ⎥<br />

(9)<br />

⎢ M M O M ⎥<br />

⎢<br />

⎥<br />

⎢⎣R1( xn) R2( xn) L Rn( xn)<br />

⎥⎦n×<br />

n<br />

and P m the polynomial moment matrix is defined as follows<br />

(10)<br />

-339-

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!