Abstract
The paper is concerned with the topology optimization of the elliptic variational inequalities using the level set approach. The standard level set method is based on the description of the domain boundary as an isocountour of a scalar function of a higher dimensionality. The evolution of this boundary is governed by Hamilton-Jacobi equation. In the paper a binary level set method is used to represent sub-domains rather than the standard method. The binary level set function takes at convergence value 1 in each sub domain of a whole design domain and \(-1\) outside this sub domain. The sub domains interfaces are represented by discontinuities of these functions. Using a two-phase approximation and a binary level set approach the original structural optimization problem is reformulated as an equivalent constrained optimization problem in terms of this level set function. Necessary optimality condition is formulated. Numerical examples are provided and discussed.
You have full access to this open access chapter, Download conference paper PDF
Similar content being viewed by others
Keywords
1 Introduction
Topology optimization problem for an elliptic second order variational inequality is considered in the paper. This inequality governs unilateral contact between an elastic body and a rigid foundation. The results concerning the existence and the uniqueness of solutions to this inequality are provided in [9]. The topology optimization problem for the elastic body in unilateral contact consists in finding such material distribution within the domain occupied by the body in contact and/or the shape of its boundary that the normal contact stress along the boundary of the body is minimized. The volume of the body is bounded.
Topology optimization of continuum structures is widely investigated in literature [1, 5, 7, 11]. Among others the homogenization method and its simplified version solid isotropic material with penalization method (SIMP) as well as evolutionary structural optimization method have been proposed to solve these problems (see [5]). Recently, the level set approach [13] is employed in the numerical algorithms of structural optimization [7] for tracking the evolution of the domain boundary on a fixed mesh and finding an optimal solution to structural optimization problems. This approach, in classical form, is based on an implicit representation of the boundaries of the optimized structure, i.e., the position of the boundary of the body is described as an isocountour of a scalar function of a higher dimensionality. The evolution of the domain boundary is governed by Hamilton-Jacobi equation. The solution of this equation requires reinitialization procedure to ensure that it is as close as possible to the signed distance function to the interface. Moreover this approach requires regularization of non-differentiable Heaviside and Dirac functions.
In order to avoid the drawbacks of the classical level set method an alternative piecewise constant level set method has been proposed, first in image processing area and next in structural optimization [14]. For a domain divided into \(2^N\) sub-domains in classical level set approach is required \(2^N\) level set functions to represent them. Piecewise constant level set method can identify an arbitrary number of sub-domains using only one discontinuous piecewise constant level set function. This function takes distinct constant values on each sub-domain. The interfaces between sub-domains are represented implicitly by the discontinuity of a set of characteristic functions of the sub-domains [14]. Comparing to the classical level set method, this method is free of the Hamilton-Jacobi equation and do not require the use of the signed distance function as the initial one. Binary level set method [4, 10, 15] is a special piecewise constant level set method where the function takes only two values either \(+1\) or \(-1\). Compared with general piecewise constant level set approach binary level set approach requires \(N\) level set functions to represent a structure of \(2^N\) different material phases and is very close to the phase-field approach [12].
In the paper the original structural optimization problem is approximated by a two-phase material optimization problem. Using the binary level set method this approximated problem is reformulated as an equivalent constrained optimization problem in terms of the binary level set function only. Therefore neither shape nor topological complicated sensitivity analysis is required. During the evolution of the binary level set function small holes can be created without the use of the topological derivatives. Necessary optimality condition is formulated. This optimization problem is solved numerically using the augmented Lagrangian method. Numerical examples are provided and discussed.
2 Problem Formulation
Consider deformations of an elastic body occupying two-dimensional domain \(\varOmega \) with the smooth boundary \(\varGamma \) (see Fig. 1). Assume \(\varOmega \subset D\) where \(D\) is a bounded smooth hold-all subset of \(R^2\). Let \(E \subset R^2\) and \(D\subset R^2\) denote given bounded domains. So-called hold-all domain \(D\) is assumed to possess a piecewise smooth boundary. Domain \(\varOmega \) is assumed to belong to the set \(O_l\) defined as follows:
where \(^\#\varOmega ^c\) denotes the number of connected components of the complement \(\varOmega ^c\) of \(\varOmega \) with respect to \(D\) and \(l \ge 1\) is a given integer. Moreover all perturbations \(\delta \varOmega \) of \(\varOmega \) are assumed to satisfy \(\delta \varOmega \in O_l\). The body is subject to body forces \(f(x)=(f_1(x),\) \( f_2(x))\), \(x \in \varOmega \). Moreover, surface tractions \(p(x)=(p_1(x),p_2(x))\), \(x \in \varGamma \), are applied to a portion \(\varGamma _1\) of the boundary \(\varGamma \). We assume, that the body is clamped along the portion \(\varGamma _0\) of the boundary \(\varGamma \), and that the contact conditions are prescribed on the portion \(\varGamma _2\), where \({\varGamma }_i \cap {\varGamma }_j = \emptyset \), \(i\ne j, \; i,j = 0,1,2\), \(\varGamma = \bar{\varGamma }_0 \cup \bar{\varGamma }_1 \cup \bar{\varGamma }_2\). We denote by \(u=(u_1,u_2)\), \(u=u(x)\), \(x \in \varOmega \), the displacement of the body and by \(\sigma (x) = \{ \sigma _{ij} (u(x)) \}\), \(i,j = 1,2\), the stress field in the body. Consider elastic bodies obeying Hooke’s law, i.e., for \(x \in \varOmega \) and \(i,j,k,l=1,2\)
We use here and throughout the paper the summation convention over repeated indices [9]. The strain \(e_{kl}(u(x))\), \(k,l=1,2\), is defined by:
where \(u_{k,l}(x) = \frac{\partial u_k(x)}{\partial x_l}\). The stress field \(\sigma \) satisfies the system of equations [9]
where \(\sigma _{ij}(x)_{,j} = \frac{\partial \sigma _{ij}(x)}{\partial x_j}\), \(i,j=1,2\). The following boundary conditions are imposed
where \(n=(n_1,n_2)\) is the unit outward versor to the boundary \(\varGamma \). Here \(u_N = u_in_i\) and \(\sigma _N = \sigma _{ij}n_in_j\), \(i,j=1,2\), represent the normal components of the displacement \(u\) and the stress \(\sigma \), respectively. The tangential components of displacement \(u\) and stress \(\sigma \) are given by \((u_T )_i = u_i - u_Nn_i\) and \((\sigma _T)_i = \sigma _{ij}n_j - \sigma _Nn_i\), \(i,j = 1,2\), respectively. \(\mid u_T \mid \) denotes the Euclidean norm in \(R^2\) of the tangent vector \(u_T\). The results concerning the existence and uniqueness of solutions to (2)–(8) can be found in [9].
2.1 Variational Formulation of Contact Problem
Let us formulate contact problem (4)–(8) in variational form. Denote by \(V_{sp}\) and \(K\) the space and set of kinematically admissible displacements:
Denote also by \(\varLambda \) the set
Variational formulation of problem (4)–(8) has the form: find a pair \((u,\lambda ) \in K \times \varLambda \) satisfying
\(i,j,k,l=1,2\). Function \(\lambda \) is interpreted as a Lagrange multiplier corresponding to term \(\mid u_T \mid \) in equality constraint in (8) [9]. In general, function \(\lambda \) belongs to the space \(H^{-1/2}(\varGamma _2)\). Here following [9] function \(\lambda \) is assumed to be more regular. The results concerning the existence and uniqueness of solutions to system (12)–(13) can be found, among others, in [9].
2.2 Structural Optimization Problem
Before formulating a structural optimization problem for the state system (12)–(13) let us introduce first the set \(U_{ad}\) of admissible domains. Domain \(\varOmega \) is assumed to satisfy the volume constraint of the form
where the constant \(Vol^{giv}=const_0 > 0\) is given. Moreover this domain is assumed to satisfy the perimeter constraint [6]
The constant \(const_1>0\) is given. The set \(U_{ad}\) has the following form
The set \(U_{ad}\) is assumed to be nonempty. In order to define a cost functional we shall also need the following set \(M^{st}\) of auxiliary functions
where the norm \(\parallel \eta \parallel _{[H^1(D)]^2} = (\sum _{i=1}^2 \parallel \eta _i \parallel _{H^1(D)}^2)^{1/2}\). Recall from [11] the cost functional approximating the normal contact stress on the contact boundary \(\varGamma _2\)
depending on the auxiliary given bounded function \(\eta (x) \in M^{st}\). \(\sigma _N\) and \(\phi _N\) are the normal components of the stress field \(\sigma \) corresponding to a solution \(u\) satisfying system (12)–(13) and the function \(\eta \), respectively.
Consider the following structural optimization problem: for a given function \(\eta \in M^{st}\), find a domain \(\varOmega ^\star \in U_{ad}\) such that
Lemma 1
There exists an optimal domain \(\varOmega ^\star \in U_{ad}\) to the problem (19).
The proof follows from Šverák theorem and arguments provided in [3, Theorem 2]. Recall from [3] the class of domains \(O_l\) determined by (1) is endowed with the complementary Hausdorff topology that guarantees the class itself to be compact. The admissibility condition \(^\#\varOmega ^c \le l\) is crucial to provide the necessary compactness property of \(U_{ad}\) [3].
3 Level Set Approach
In [11] the standard level set method [13] is employed to solve numerically problem (19). Let \(t>0\) denote the time variable. Consider the evolution of a domain \(\varOmega \) under a velocity field \(V=V(x,t)\). Under the mapping \(T(t,V)\) we have
By \(\varOmega ^-_t\) and \(\varOmega ^+_t\) we denote the interior and the outside of the domain \(\varOmega _t\), respectively. This domain and its boundary \(\partial \varOmega _t\) are defined by a function \(\phi =\phi (x,t) \; : \; R^2 \times [0, t_0) \rightarrow R \) satisfying the conditions:
In the standard level set approach Heaviside function and Dirac function are used to transform integrals from domain \(\varOmega \) into domain \(D\). Assume that velocity field \(V\) is known for every point \(x\) lying on the boundary \(\partial \varOmega _t\), i.e., such that \(\phi (x,t)=0\). Therefore the equation governing the evolution of the interface in \(D\times [0, t_0]\), known as Hamilton-Jacobi equation, has the form [13]
Moreover \(\phi (x,0)=\phi _0\) where \(\phi _0(x)\) is a given function close to the signed distance function [13].
3.1 Binary Level Set Formulation
Recall from [4, 10] the notion of a binary level set function. Let \(N\) be a given integer. Assume an open bounded domain \(D\) in \(R^2\) is partitioned into \(2^N\) sub-domains \(\{ \varOmega _j \}^{2^N}_{j=1}\) such that
\(\partial \varOmega _j\) denotes the boundary of the sub-domain \(\varOmega _j\). For \(N=2\) this function mapping \(\phi : D \rightarrow R\), is defined as:
The interface \(\partial \varOmega _1=\partial \varOmega _2\) is implicitly defined by the discontinuity of \(\phi \), i.e., \(\partial \varOmega _1=\{ x \in D \; : \; \phi (x)=\kappa , \; \; \kappa \in (-1,1) \}\). In order to ensure that for every \(x \in D\) this function converges to values \(+1\) and \(-1\) it is supposed to satisfy:
More generally, using \(N\) binary level set functions \(\phi _i\), \(i=1,2, ...,N\), satisfying (24) we can represent \(2^N\) sub-domains \(\varOmega _j\) of \(D\). The characteristic functions \(\chi _j\), \(j=1,2,...,2^N\), of the sub-domains \(\varOmega _j\) in terms of binary level set functions \(\phi _i\) are represented as
For \(j=1,2,...,2^N\) and \(i=1,...,N\) numbers \(b_i^{j-1}=0 \vee 1\) denotes binary representation of \(j-1\)th sub-domain. As long as each binary function satisfies (24) and \(\chi _j(x)\) are defined by (25) then
Condition (26) ensures non overlapping of the phases while (27) prevents vacuums. Basis functions \(\chi _j\) are used to calculate the length of the boundary \(\partial \varOmega _j\) as well as the area inside \(\varOmega _j\) using the integrals:
The length of the boundary \(\partial \varOmega _j\) of sub-domain \(\varOmega _j\) equals the total variation of \(\chi _j\) [2]. Consider piecewise constant density function \(\rho =\rho (x) : D \rightarrow R^2\) defined as
where \(0 < c_1 < c_2 < \infty \) denote two given material densities. This function can be constructed as a weighted sum of the characteristic functions \(\chi _j\). Denoting by \(\{ c_j \}^{2^N}_{j=1}\) a set of real scalars, we can represent a piecewise constant function \(\rho \) taking these \(2^N\) distinct constant values in sub-domains \(\varOmega _j\) by
We confine to consider a two-phase problem in the domain \(D\), i.e., we set \(N=2\) and \(c_1=\epsilon \), \(\epsilon >0\) as well as \(c_2=1\). Since \(\varOmega \) consists from two sub-domains one binary level set function \(\phi \) satisfying (24) will be used to describe these sub-domains. Therefore
Using (22) as well as (32) the structural optimization problem (19) can be transformed into the following one: find \(\phi \in U_{ad}^\phi \) such that
where the set \(U_{ad}^\phi \) of the admissible functions is given as
The element \((u_\epsilon ,\lambda _\epsilon ) \in K \times \varLambda \) depending on \(\epsilon \) satisfies the state system (12)–(13) in the domain \(D\) rather than \(\varOmega \):
Lemma 2
There exists an optimal solution \(\phi \in H^1(D)\) to the optimization problem (33)–(37).
The proof follows from the lower semicontinuity in \(L^1(D)\) of the regularization term in (34) see [2, Theorem 3.2.1, p. 75].
3.2 Necessary Optimality Conditions
In order to formulate the necessary optimality condition for the optimization problem (33)–(37) we introduce the Lagrangian \(L(\phi , \tilde{\lambda })= L(\phi , u_\epsilon , \lambda _\epsilon , p^a, q^a, \tilde{\lambda } )\):
where \(i,j,k,l=1,2\), \(\tilde{\lambda }=\{ \tilde{\lambda }_i \} ^3_{i=1}\), \(d(\phi )=\{ d_i(\phi ) \}_{i=1}^3 = [Vol(\phi ), W(\phi ), Per(\phi )]^T\), \(d^T(\phi )\) denotes a transpose of \(d(\phi )\), \(\mu _m>0\), \(m=1,2,3\), is a given real. Element \((p^a,q^a) \in K_1 \times \varLambda _1 \) denotes an adjoint state defined as follows:
The sets \(K_{1}\) and \(\varLambda _1\) are given by
while the coincidence set \(A^{st} = \{ x \in \varGamma _2 \; : \; u_N = 0 \}\). Moreover \(B_1=\{ x \in \varGamma _2 : \lambda (x)=-1\}\), \(B_2=\{ x \in \varGamma _2 : \lambda (x)=+1\}\), \(\tilde{B}_i=\{ x \in B_i: u_N(x) =0 \}\), \(i=1,2\), \(B_i^+=B_i\setminus \tilde{B}_i\), \(i=1,2\). The derivative of the Lagrangian \(L\) with respect to \(\phi \) has the form:
where \(\rho ^\prime (\phi ) = c_1-c_2=1 - \epsilon \), \(d^\prime (\phi )=[Vol^\prime (\phi ), W^\prime (\phi ), Per^\prime (\phi )]\) and
Using (39)–(45) we can formulate the necessary optimality condition:
Lemma 3
If \(\hat{\phi }\in U_{ad}^\phi \) is an optimal solution to the problem (33)–(37) than there exists Lagrange multiplier \(\tilde{\lambda }^\star =(\tilde{\lambda }^\star _1, \tilde{\lambda }^\star _2,\tilde{\lambda }^\star _3) \in R^3\) such that \(\tilde{\lambda }_1^\star , \tilde{\lambda }_3^\star \ge 0\) satisfying
Proof follows from standard arguments [6, 8]. Recall [6, 9] condition (46) implies that for all \(\phi \in U_{ad}^\phi \) and \(\tilde{\lambda } \in R^3\)
4 Numerical Experiments
The optimization problem (33)–(37) is discretized using the finite element method [8, 9]. The finite difference method is used to approximate interface evolution (gradient flow) equation [2]. The discretized structural optimization problem (33)–(37) is solved numerically. We employ Uzawa type algorithm to solve numerically optimization problem (33)–(37). The algorithm is programmed in Matlab environment. As an example a body occupying 2D domain
is considered. The boundary \(\varGamma \) of the domain \(\varOmega \) is divided into three disjoint pieces
The domain \(\varOmega \) and the boundary \(\varGamma _2\) depend on the function \(v\) given as in Fig. 1. The obtained optimal domain is presented in Fig. 2. The areas with low values of density function appear in the central part of the body and near the fixed edges. The obtained normal contact stress is almost constant along the optimal shape boundary and has been significantly reduced comparing to the initial one.
References
Allaire, G., Jouve, F., Toader, A.: Structural optimization using sensitivity analysis and a level set method. J. Comput. Phys. 194, 363–393 (2004)
Aubert, G., Kornprobst, P.: Mathematical Problems in Image Processing. Springer, New York (2006)
Chambolle, A.: A density result in two-dimensional linearized elasticity and applications. Arch. Ration. Mech. Anal. 167, 211–233 (2003)
Dai, X., Tang, P., Cheng, X., Wu, M.: A variational binary level set method for structural topology optimization. Commun. Comput. Phys. 13(5), 1292–1308 (2013)
Deaton, J.D., Grandhi, R.V.: A survey of structural and multidisciplinary continuum topology optimization: post 2000. Struct. Multidiscipl. Optim. 49, 1–38 (2014)
Delfour, M.C., Zolesio, J.P.: Shapes and Geometries: Analysis, Differential Calculus and Optimization. SIAM Publications, Philadelphia (2001)
van Dijk, N.P., Maute, K., Langlaar, M., van Keulen, F.: Level-set methods for structural topology optimization: a review. Struct. Multidiscipl. Optim. 48, 437–472 (2013)
Haslinger, J., Mäkinen, R.: Introduction to Shape Optimization: Theory, Approximation, and Computation. SIAM Publications, Philadelphia (2003)
Hlaváček, I., Haslinger, J., Nečas, J., Lovišek, J.: Solving of Variational Inequalities in Mechanics. Springer, New York (1988)
Lie, J., Lysaker, M., Tai, X.C.: A binary level set model and some applications to Mumford Shah image segmentation. IEEE Trans. Image Process. 15(5), 1171–1181 (2006)
Myśliński, A.: Level set method for optimization of contact problems. Eng. Anal. Bound. Elem. 32, 986–994 (2008)
Yamada, T., Izui, K., Nishiwaki, S., Takezawa, A.: A topology optimization method based on the level set method incorporating a fictitious interface energy. Comput. Methods Appl. Mech. Eng. 199(45–48), 2876–2891 (2010)
Osher, S., Fedkiw, R.: Level Set Methods and Dynamic Implicit Surfaces. Springer, New York (2003)
Zhu, S., Wu, Q., Liu, C.: Shape and topology optimization for elliptic boundary value problems using a piecewise constant level set method. Appl. Numer. Math. 61, 752–767 (2011)
Zhu, S., Liu, C., Wu, Q.: Binary level set methods for topology and shape optimization of a two-density inhomogeneous drum. Comput. Methods Appl. Mech. Eng. 199(45–48), 2970–2986 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 IFIP International Federation for Information Processing
About this paper
Cite this paper
Myśliński, A. (2014). Binary Level Set Method for Topology Optimization of Variational Inequalities. In: Pötzsche, C., Heuberger, C., Kaltenbacher, B., Rendl, F. (eds) System Modeling and Optimization. CSMO 2013. IFIP Advances in Information and Communication Technology, vol 443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-45504-3_19
Download citation
DOI: https://doi.org/10.1007/978-3-662-45504-3_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-45503-6
Online ISBN: 978-3-662-45504-3
eBook Packages: Computer ScienceComputer Science (R0)