1 Introduction

It is well known that there is a resemblance between, on the one hand, bone remodeling theories based on adaptive elasticity and apparent density, see Cowin and Hegedus [5], and, on the other hand, material distribution optimization problems such as that given by the SIMP formulation of topology optimization, see, e.g., Christensen and Klarbring [4]. Research aimed at applying topology optimization theory to bone remodeling can be found in, e.g., recent work by Jang and Kim [1113], while studies with the converse aim, i.e., applying bone remodeling theories in structural and topology optimization, can be found in Penninger et al. [19] and Andreaus et al. [1]. The theoretical basis for this connection of theories is independently discussed in Jang et al. [14] and Klarbring and Torstenfelt [15, 16]. To be more specific, in the latter works we showed that there is a one-to-one correspondence between a dynamical systems approach to SIMP topology optimization and the apparent density bone remodeling theory of Harrigan and Hamilton [8, 9]. The latter theory is based on a formal finite element formulation where Young’s modules is related to the density by a power law, and a strain energy driven evolution equation for the density is used.

In the following we extend this analogy and develop a refined theory comprising the so-called lazy zone concept, meaning that, for a certain intermediate range of remodeling stimuli, no bone remodeling takes place. This concept was originally suggested in an experimental context by Carter [3] and first used in a computational model by Huiskes et al. [10]. It has since then been discussed and used in a large number of publications. Its general idea is depicted in Fig. 1 of this paper where the apparent density evolution is represented by the y-axis and the strain energy stimuli is represented by the x-axis.

Fig. 1
figure 1

Geometric representation of equation (15), including a lazy zone of length d  + d +

Our theoretical development starts from a Lyaponov-type inequality, which in the dynamical systems approach replaces the optimization formulation as the basic problem statement. We then observe that this inequality resembles the well-known dissipation inequality of thermodynamics, stated for instance in Gurtin et al. [7] or Frémond [6]. In fact, the logical status of these two inequalities are the same: we are to find a dynamical system that satisfies the inequality for all possible evolutions. In thermodynamics, this particular modeling step is known as the Coleman–Noll procedure, [6, 7]. Following this procedure we derive a general dynamical system that when specialized takes the form of a lazy zone bone remodeling theory.

The resulting dynamical system is subsequently investigated by developing a numerical method based on an implicit time discretization, followed by a sequential explicit convex approximation in the standard manner of structural optimization, see, e.g., Christensen and Klarbring [4]. Next, we present a series of numerical solutions showing the influence of different modeling parameters. Finally, the conclusions of our investigations are summarized.

2 Basic theory

The standard formulation of structural optimization (the sizing, density or SIMP topology optimization version), see e.g. [4], is the following:

$$ \min_{\varvec{u}, {\varvec\rho}\in K} f({\varvec{u},{\varvec\rho}})\quad{\hbox{subject to}\; {\varvec F}={\varvec K}({\varvec\rho}){\varvec u}}, $$
(1)

where

  • \(\varvec{\rho}=(\rho_1,\ldots,\rho_E)^T\) is a vector of E design or configurational variables (see discussion below);

  • K is a set of such variables. In the following it takes the form of simple box constraints, i.e.,

    $$ K=\prod_{i=1}^EK_i,\quad K_i=\{\rho_i\mid\underline {\rho}\leq \rho_i\leq\overline{\rho}\}, $$

    where \(\underline {\rho}\) and \(\overline{\rho}\) are upper and lower bounds;

  • the equilibrium equation of discrete structures

    $$ \varvec{F}=\varvec{K}(\varvec{\rho})\varvec{u}, $$
    (2)

    consists of a vector \(\varvec{F}\) of external forces, a displacement vector \(\varvec{u}\) and a positive semi-definite stiffness matrix \(\varvec{K}(\varvec{\rho})\) that depends on \(\varvec{\rho}\);

  • and \(f(\varvec{u},\varvec{\rho})\) is a goal or objective function.

Here E is the number of finite elements in the structure, and for simplicity we assume that there is one design variable for each such element.

In the SIMP formulation, the dependence of the stiffness matrix on the vector \(\varvec{\rho}\) is given by

$$ \varvec{K}(\varvec{\rho})=\sum_{i=1}^E\rho_i^q{\varvec{K}}_i $$
(3)

where q is a positive exponent and \({\varvec{K}}_i\) is an element stiffness matrix for a unit value of the design variable ρ i . In topology optimization, \(\varvec{\rho}\) is a design variable whose elements take values between 0 and 1, i.e., \(\underline {\rho}=0\) and \(\overline{\rho}=1,\) and intermediate values are penalized by letting the exponent q of (3) be larger than one. In the bone remodeling interpretation of the same formulation, \(\varvec{\rho}\) represents an apparent density, and while its lower bound is still zero, its upper bound corresponds to the density of compact bone. In the following we will refer to \(\varvec{\rho}\) as a vector of configurational variables, somehow including two different interpretations of the theory.

In this paper we use a dynamical systems approach and do not deal directly with the optimization problem (1). Rather, we regard the displacements and the configurational variables as depending on a time variable t, i.e., \(\varvec{u}=\varvec{u}(t)\) and \(\varvec{\rho}=\varvec{\rho}(t),\) and derive dynamical systems that satisfy certain Lyaponov-type inequalities. A simple such inequality, see [16], which can be applied when the external force \(\varvec{F}\) does not depend on time, reads

$$ \frac{d}{dt}f(\varvec{u},\varvec{\rho})\leq 0\quad{\hbox{for all }\quad \varvec{u}\; \hbox{ and }\;\varvec{\rho}\in K \;\hbox{ such that }\; \varvec{F}=\varvec{K}(\varvec{\rho})\varvec{u}}. $$
(4)

That is, we assume a quasi-static time evolution of the system such that the goal or objective function is never increasing. For biological systems, such as those involved in bone remodeling, stating an inequality like (4) implies that we have, experimentally or otherwise, observed an extremum property that we use as a postulate in modeling. The observation could be, e.g., that cost of material and/or mechanical efficiency are developing towards lower or homeostatic values during a growth process.

Obviously, (4) is a statement of different kind from (1): the latter problem is to be solved for a certain optimum \((\varvec{u}^*,\varvec{\rho}^*)\), while (4) is a requirement that should be satisfied by a dynamical system. An example of a dynamical system that satisfies (4) is

$$ \dot{\rho}_i=-\frac{\partial\tilde{f}(\varvec{\rho})}{\partial\rho_i}, $$
(5)

where a superposed dot indicates a time derivative, and \(\tilde{f}(\varvec{\rho})=f(\varvec{u}(\varvec{\rho}),\varvec{\rho})\), where \(\varvec{u}(\varvec{\rho})\) solves (2), assuming that the stiffness matrix is non-singular. Equation (5) and the optimization problem (1) are now related in the sense that an equilibrium point \(\varvec{\rho}^*\) of (5) (satisfying \({\partial\tilde{f}(\varvec{\rho}^*)}/{\partial\rho_i}=0\)) has the property that \((\varvec{u}(\varvec{\rho}^*),\varvec{\rho}^*)\) is a stationary point of (1) and the time sequence \(\varvec{\rho}=\varvec{\rho}(t)\) defined by (5) converges towards such a point. However, not all dynamical systems that satisfy (4) define sequences that converge to stationary points of (1), and such systems will in fact be central to the present investigation. In such cases, however, we regard (4) as a statement that is closer to the physical behavior that we want to model than (1) is.

We may also note that the case of a time-dependent load and objective function, as well as the extension to cyclic loading, is discussed in Klarbring and Torstenfelt [16].

2.1 Dynamical system

We will now derive a general dynamical system that satisfies the Lyaponov inequality (4). Such a derivation is analogous to that of the Coleman–Noll procedure of thermodynamics. As a first step we relax the equilibrium equation (2). Taking its time derivative (for constant \(\varvec{F}\)) yields

$$ \sum_{i=1}^E\frac{\partial\varvec{K}(\varvec{\rho})}{\partial\rho_i} \varvec{u}\dot{\rho}_i+\varvec{K}(\varvec{\rho})\dot{\varvec{u}}={\mathbf{0}}. $$

By multiplying this equation by a Lagrangian multiplier vector \(\varvec{\lambda}\) and adding to the inequality in (4), we get

$$ \left[\nabla_uf(\varvec{u},\varvec{\rho})^T+\varvec{\lambda}^T\varvec{K}(\varvec{\rho})\right]\dot{\varvec{u}}+\sum_{i=1}^E\left[\frac{\partial f(\varvec{u},\varvec{\rho})}{\partial \rho_i}+\varvec{\lambda}^T\frac{\partial\varvec{K}(\varvec{\rho})}{\partial\rho_i}\varvec{u}\right]\dot{\rho}_i\leq 0, $$

which must be satisfied for all evolutions of \(\varvec{u},\varvec{\lambda}\) and \(\varvec{\rho}\in K\). This requirement can be met by assuming the adjoint system

$$ \nabla_uf(\varvec{u},\varvec{\rho})+\varvec{K}(\varvec{\rho})\varvec{\lambda}={\mathbf{0}}, $$
(6)

where we have used the symmetry of \(\varvec{K}(\varvec{\rho})\), and the inequality

$$ \sum_{i=1}^E {R}_i\dot{\rho}_i\geq 0, $$
(7)

where R i are configurational forces associated with growth that satisfy

$$ -{R}_i\in\frac{\partial f(\varvec{u},\varvec{\rho})}{\partial \rho_i}+\varvec{\lambda}^T\frac{\partial\varvec{K}(\varvec{\rho})}{\partial\rho_i}\varvec{u}+\partial I_{K_i}(\rho_i). $$
(8)

In the last term of (8), the symbol ∂ indicates the subdifferential of a convex function, see, e.g., Rockafellar [20] or, for its use in mechanics, Panagiotopoulos [18] and Frémond [6]. The convex function is in this case the indicator function of the convex set K i , i.e., a function that takes the value 0 for points inside the set and infinity for points outside the set.

A direct way of satisfying (7) for all \(\dot{\rho}_i\) is to postulate the relation \({R}_i={k}_i\dot{\rho}_i\) for a non-negative function k i that could, e.g., depend on \(\varvec{\rho}\), \(\varvec{u}\) and their time derivatives. This was the route taken in Klarbring and Torstenfelt [16]. However, here we will take an alternative approach that will eventually lead to the incorporation of the lazy zone concept into the model. We will use positive convex potentials \(D_i(\dot{\rho}_i)\), with the properties 0 = D i (0), \(0\in \partial D_i(0)\), and such that

$$ {R}_i\in \partial D_i(\dot{\rho}_i), $$
(9)

see, e.g., Frémond [6]. The potential could depend on other variables than \(\dot{\rho}_i\) in the same way as for k i , but these act as parameters and the subdifferential is with respect to \(\dot{\rho}_i\). Note that (9) can be multi-valued and the potential could take the value \(\infty\), implying a constraint on admissible values of \(\dot{\rho}_i\), which are features not present in \({R}_i={k}_i\dot{\rho}_i\). On the other hand, \({R}_i={k}_i\dot{\rho}_i\) could represent a non-monotone relation between R i and \(\dot{\rho}_i\), which is not included in (9) since D needs to be convex. A non-convex generalization of (9) has, however, been suggested by Panagiotopoulos [18]. Using (9), the evolution law for configurational variables now reads

$$ 0\in\frac{\partial f(\varvec{u},\varvec{\rho})}{\partial \rho_i}+\varvec{\lambda}^T\frac{\partial\varvec{K}(\varvec{\rho})}{\partial\rho_i}\varvec{u}+\partial D_i(\dot{\rho}_i)+\partial I_{K_i}(\rho_i). $$
(10)

In the following we will investigate the particular convex potential

$$ D_i=\frac{a_i c}{2}\dot{\rho}_i^2+\left\{\begin{array}{ll} a_i d_+ \dot{\rho}_i &{\hbox{ if }\dot{\rho}_i\geq 0}\\ -a_i d_- \dot{\rho}_i &{\hbox{ if }\dot{\rho}_i< 0}, \end{array}\right. $$
(11)

where cd + and d are positive constants and a i may be interpreted as the volume (or area) of element i. The choice of this potential is basically one of convenience: it is the simplest potential that includes both a viscous growth effect, represented by the first term, and a plastic growth behavior, represented by the second term. However, an important motivation for choosing this particular potential is that it turns out to model the lazy zone behavior of bone remodeling, i.e., there is a range of stimulus for which no growth takes place, see [3, 10]. With this potential (9) becomes

$$ {R}_i\in {a_i c}\dot{\rho}_i+\left\{\begin{array}{ll} a_i d_+ &{\hbox{if } \dot{\rho}_i> 0}\\ a_i[-d_-,d_+] &{\hbox{if }\dot{\rho}_i= 0}\\ -a_i d_- &{\hbox{if } \dot{\rho}_i< 0}. \end{array}\right. $$

Since this relation is multi-valued it is different from what can be represented by \({R}_i={k}_i\dot{\rho}_i\), even when k i is a general function of \(\dot{\rho}_i. \)

2.2 Special goal function

The preceding presentation is valid for a general objective or goal function. Here we will specialize to a particular function that involves compliance (inverse of stiffness), C, and cost of material, W, defined by

$$ C=\frac{1}{2}\varvec{F}^T\varvec{u}\quad{\hbox{and}}\quad W=\sum_{i=1}^Ea_i\rho_i. $$

If the cost of material is measured by its weight, which is a natural choice, the constant a i would be the volume of element i. A natural goal function is now

$$ f=C+\mu W, $$
(12)

for some constant μ. For this special case, \(\nabla_uf(\varvec{u},\varvec{\rho})=\varvec{F}/2\), so by comparing the adjoint system (6) and the equilibrium equation (2) one finds that \(\varvec{\lambda}=-{\varvec{u}}/{2}\). Moreover, assuming that \(\varvec{K}(\varvec{\rho})\) is non-singular for all \(\varvec{\rho}\in K\), \(\varvec{u}\) can be seen as a function of \(\varvec{\rho}\), defined by (2). This implies that (10) takes the form

$$ 0\in\mu a_i-e_i(\varvec{\rho})+\partial D_i(\dot{\rho}_i)+\partial I_{K_i}(\rho_i), $$
(13)

where we have used the notation

$$ e_i(\varvec{\rho})=\frac{1}{2}\varvec{u}^T\frac{\partial\varvec{K} (\varvec{\rho})}{\partial\rho_i}\varvec{u}. $$

Specializing further by taking the particular form of the function D i in (11), (13) becomes

$$ 0\in\mu a_i-e_i(\varvec{\rho})+{a_i c}\dot{\rho}_i+\left\{\begin{array}{ll} a_i d_+ &{\hbox{if }\dot{\rho}_i> 0}\\ a_i[-d_-,d_+]& {\hbox{if } \dot{\rho}_i= 0}\\ -a_i d_- & {\hbox{if } \dot{\rho}_i< 0}. \end{array}\right. $$
(14)

When \(c\not= 0\), this inclusion can be inverted and we obtain

$$ \dot{\rho}_i=\left\{\begin{array}{ll} c^{-1}\left(\frac{e_i(\varvec{\rho})}{a_i}-\mu-d_+\right) &\hbox{if}\quad\frac{e_i(\varvec{\rho})}{a_i}>\mu+ d_+\\ 0 &\hbox{if}\quad\mu- d_-\leq\frac{e_i(\varvec{\rho})}{a_i}\leq \mu+ d_+\\ c^{-1}\left(\frac{e_i(\varvec{\rho})}{a_i}-\mu +d_-\right) & \hbox{if}\quad\frac{e_i(\varvec{\rho})}{a_i}<\mu - d_-. \end{array}\right. $$
(15)

Note that since \(e_i(\varvec{\rho})\geq 0\), due to positive semi-definiteness of \(\varvec{K}_i\), we need to have μ > d for the last line to ever be applicable. This means that bone resorption never takes place unless this condition holds, and the physical interpretation is that the cost of bone has to be higher than a measure of energy consumption when removing bone. Equation (15) appears as a purely phenomenological equation in the bone remodeling literature. It is thought of as modeling the so called lazy zone behavior, which means that for mature bone there is a range of stimuli for which the bone is stable and does not remodel. Note that the stimuli turns out to be

$$ \frac{e_i(\varvec{\rho})}{a_i}=qU_i,\quad U_i=\frac{1}{2}\frac{\varvec{u}^T\rho_i^q\varvec{K}_i\varvec{u}}{a_i \rho_i}, $$

where U i is the mass specific strain energy of element i. Equation (15) is illustrated in Fig. 1.

When c = 0, (14) represents a purely plastic behavior; it implies

$$ \mu- d_-\leq\frac{e_i(\varvec{\rho})}{a_i}\leq \mu+ d_+, $$

together with the growth direction criterion

$$ \dot{\rho}_i\left\{\begin{array}{lll}\geq 0 &\hbox{if}&\frac{e_i(\varvec{\rho})}{a_i}=\mu+ d_+\\ = 0 &\hbox{if}&\mu- d_- < \frac{e_i(\varvec{\rho})}{a_i} < \mu+ d_+\\ \leq 0 &\hbox{if}&\frac{e_i(\varvec{\rho})}{a_i}=\mu - d_-.\end{array}\right. $$

3 Numerical method

For the numerical integration of (13), including (14) as a special case, we discretize time into steps of length \(\Updelta t\). Given a solution \(\varvec{\rho}^n\) at time t n , we find the solution \(\varvec{\rho}\) at time t n+1 by solving

$$ 0\in \frac{df(\varvec{u}(\varvec{\rho}),\varvec{\rho})}{d\rho_i}+\partial I_{K_i}(\rho_i)+\partial D_i\left(\frac{\rho_i-\rho_i^n}{\Updelta t}\right). $$
(16)

This is essentially an implicit time discretization scheme and (16) defines a unilateral stationary point of the optimization problem

$$ ({\mathcal{M}})^n\quad\min_{\varvec{\rho}\in K}\left[f(\varvec{u}(\varvec{\rho}),\varvec{\rho})+\Updelta t\sum_{i=1}^ED_i\left(\frac{\rho_i-\rho_i^n}{\Updelta t}\right)\right]. $$

To solve \((\mathcal{M})^n\), in the case when D i is given by (11), we suggest a sequential convex approximation strategy, see Christensen and Klarbring [4]. This means solving an iterative sequence of problems defined by convex approximations of the objective function of \((\mathcal{M})^n\). These approximations should involve explicit functions of \(\varvec{\rho}\), as opposed to the original objective function where \(\varvec{u}(\varvec{\rho})\) is defined implicitly by solving (2). The first term of the goal function, see (12), is linearized in the, so-called, intervening variables ρ −α i , α > 0, see Christensen and Klarbring [4]. If the linearization is made at the point \(\varvec{\rho}^k\) we obtain

$$ f(\varvec{u}(\varvec{\rho}),\varvec{\rho})\approx{\hbox{const.}} +\sum_{i=1}^E\left[e_i(\varvec{\rho}^k)\alpha^{-1}(\rho_i^k)^ {1+\alpha}\rho_i^{-\alpha}+\mu a_i\rho_i\right]. $$
(17)

The approximation of \((\mathcal{M})^n\) then reads

$$ ({\mathcal{M}})^{n,k}\quad\min_{\varvec{\rho}\in K}\sum_{i=1}^E\varphi_i^{n,k}(\rho_i)=\sum_{i=1}^E\min_{\rho_i\in K_i}\varphi_i^{n,k}(\rho_i), $$

where

$$ \begin{aligned} \varphi_i^{n,k}(\rho_i)&=e_i({\varvec{\rho}}^k)\alpha^{-1} (\rho_i^k)^{1+\alpha}\rho_i^{-\alpha}+\mu a_i\rho_i\\ &\quad+\frac{1}{2}c_ia_i\frac{(\rho_i-\rho_i^n)^2}{\Updelta t}+\left\{\begin{array}{ll} d_+a_i (\rho_i-\rho_i^n) & {\hbox{if } \rho_i\geq\rho_i^n}\\ -d_-a_i (\rho_i-\rho_i^n) & {\hbox{if } \rho_i<\rho_i^n}. \end{array}\right. \end{aligned} $$

The switch of min and sum in \((\mathcal{M})^{n,k}\) is possible due to the separability of the approximation (17). The solution of the inner convex subproblem of minimizing \(\varphi_i^{n,k}(\rho_i)\) over the interval K i will be one out of five types: the minimum is taken

  1. (1)

    at the left endpoint \(\rho_i=\underline {\rho}\),

  2. (2)

    at the right endpoint \(\rho_i=\overline{\rho}\),

  3. (3)

    at the non-differentiable point ρ i  = ρ n i ,

  4. (4)

    at a stationary point on the interval \(\underline {\rho}<\rho_i<\rho_i^n\), or

  5. (5)

    at a stationary point on the interval \(\rho_i^n<\rho_i<\overline{\rho}. \)

Making the trail assumption that a stationary point occurs in the interval \(\rho_i^n<\rho_i<\overline{\rho}\) we find

$$ \frac{\partial\varphi_i^{n,k}(\rho_i)}{\partial\rho_i}=a_i(\mu +d_+)+\frac{c_ia_i}{\Updelta t}(\rho_i-\rho_i^n)-e_i(\varvec{\rho}^k)(\rho_i^k)^{1+\alpha}\rho_i^{-(1+\alpha)}=0. $$

For general constants, this is an equation that is not explicitly solvable. Nonetheless, we call its unique solution \(^1\hat{\rho}_i^k\) and for the special case c i  = 0 we have

$$ \rho_i=\left(\frac{e_i(\varvec{\rho}^k)}{a_i(\mu+d_+)}\right) ^{\frac{1}{1+\alpha}}{\rho}_i^k. $$

Assuming that a stationary point is taken in \(\underline {\rho}<\rho_i<\rho_i^n\) we find the same equation where d + is replaced for −d . The corresponding solution is denoted \(^2\hat{\rho}_i^k\), and we end up with the following updating alternatives:

$$ \begin{array}{llll} \hbox {if}& \ ^1\hat{\rho}_i^k\geq \overline{\rho} & \hbox {then} & \rho_i^{k+1}= \overline{\rho} \\ \hbox {if} & \ ^2\hat{\rho}_i^k\leq\underline {\rho} & \hbox {then} & \rho_i^{k+1}=\underline {\rho} \\ \hbox {if} & \overline{\rho}>\!\ ^1\hat{\rho}_i^k>\rho_i^n & \hbox {then} & \rho_i^{k+1}=\!\ ^1\hat{\rho}_i^k \\ \hbox {if} & \underline {\rho} <\!\ ^2\hat{\rho}_i^k<\rho_i^n & \hbox {then} & \rho_i^{k+1}=\!\ ^2\hat{\rho}_i^k \\ \hbox {if} & \ ^2\hat{\rho}_i^k\geq \rho_i^n\geq\!\ ^1\hat{\rho}_i^k& \hbox {then} & \rho_i^{k+1}=\rho_i^n. \end{array} $$

Finally it should be remarked that when the exponent q in (3) is grater than one, it is well known that the underlying continuum problem may lack a solution, which shows up in the discrete problem as checkerboards and mesh dependence, see [4]. To avoid such incorrect solutions, we use the filtering scheme suggested by Sigmund, discussed in [21]. It essentially means using a weighted averaging of \(e_i(\varvec{\rho}^k)\) over nearby elements. It is interesting that checkerboards appeared also in early bone remodeling calculations, and to remedy this Mullender et al. [17] introduced a spatial influence function and the notion of sensor cells, in close analogy with the filter approach used in topology optimization.

4 Numerical results

We like to investigate the influence on the solution of the parameters c (viscosity), d + and d (plasticity), as well as the initial distribution of the configurational variable \(\varvec{\rho}\). The loading will be a step loading (time independent \(\varvec{F}\)) and we will presents plots showing converged, i.e., equilibrium, distributions of \(\varvec{\rho}\). We divide the investigation into two parts: first the convex case q = 1 and then the non-convex case of q = 3 are treated. For a discussion of convexity and non-convexity of these goal functions we refer to Svanberg [22]. The dimensions of the computational domain are 1.8 by 0.3 and the load is uniformly distributed over a boundary segment of length 0.06. Due to symmetry, we model half of the domain. Poisson’s ratio is taken to be 0.3. The finite element discretization is obtained by four node square Lagrangian displacement elements of length 0.01 resulting in a total of 2,700 elements. The upper and lower bounds on the configurational variable are \(\underline {\rho}=0.001\approx 0\) and \(\overline{\rho}=1\). For each set of problems, we fix the value of the constant μ by first solving a classical stiffness optimization problem with volume constraint. In such a problem μ corresponds to a Lagrangian multiplier, Christensen and Klarbring [4].

4.1 Convex case

In Fig. 2 we show the influence of the plasticity parameter d , while c and d + are set to zero. In the the top plot, however, d  = 0, which reduces the problem to a classical problem (essentially the convex variable thickness sheet problem, see [4]), while in the other two plots d is set to a fraction of μ, namely 0.5 μ and 0.8 μ. Since c = 0, the problem is reduced to a single time step: after convergence of the first time step there is no change in the solution in the following steps since the load is constant. This is a consequence of the time scale independence of plasticity problems. However, even though the scale is unimportant, the problem is path dependent when \(d_-\not=0\), implying that the initial distribution of \(\varvec{\rho}\) has an influence on the final solution. In Fig. 2 it is seen that the plasticity effect prevents material from being removed: the top picture represents the minimum of the goal function f = C + μ W while in the other two pictures the plasticity or friction effect prevents the solution from reaching this minimum. If the displacement value for the central point under the load is normalized so that its value in the top picture of Fig. 2 is 1, the corresponding displacements, in the same scale, for the other two solutions are 0.7976 and 0.6501. These numbers indicate the obvious fact that stiffer structures are obtained when less material is removed.

Fig. 2
figure 2

The influence of the plasticity parameter d when c = d + = 0, we start from an initial distribution of \(\rho_i=\overline{\rho}\) for all elements, and q = 1. From top to bottom we have set d equal to 0, 0.5 μ and 0.8 μ

In Fig. 3 the opposite effect to that in Fig. 2 is illustrated: the plasticity parameter d + is varied, while c and d are set to zero and we start from an initial configurational parameter which takes the lower value \(\underline {\rho}\approx 0\) in all elements. The upper plot is the same as the upper picture in Fig. 2, i.e., it is the reference case of all three parameters being zero. In the lower two plots we have set d + equal to μ and 2 μ, respectively. In this case the plasticity or friction prevents material from being added and the displacement under the load becomes, when normalized, 1, 1.309 and 1.550 from top to bottom.

Fig. 3
figure 3

The influence of the plasticity parameter d + when c = d  = 0, we start from an initial distribution of \(\rho_i=\underline {\rho}\) for all elements, and q = 1. From top to bottom we have set d + equal to 0, μ and 2 μ

We now turn to the influence of the parameter c. In Fig. 4 we start from a distribution \(\rho_i=\overline{\rho}\) in all elements and d  = 0.5 μ. We then show converged, i.e., equilibrium distributions, for three values of c, namely \(0, 10^{-14}\Updelta t\) and \(10^{-12}\Updelta t\). It is clear that c has the effect of smoothing out the solution, increasing the length scale of its geometrical features. The normalized displacements become 1, 1.003 and 1.010. Thus, a non-zero c gives a distribution that represents a marginally less stiff structure. Note that viscosity (non-vanishing c) introduces a time scale into the problem and we have to use a sequence of time steps. A similar test on the influence of c has also been done for the case with initial distribution \(\underline {\rho}\approx 0\). Essential the same behavior as in the reported test is found.

Fig. 4
figure 4

The influence of the viscosity parameter c when d + = 0, d  = 0.5 μ, we start from an initial distribution of \(\rho_i=\overline{\rho}\) for all elements, and q = 1. From top to bottom we have set c equal to 0, \(10^{-14}\Updelta t\) and \(10^{-12}\Updelta t\)

4.2 Non-convex case

The sequence of test runs reported above can also be made for the non-convex case of q = 3. The solutions then become more of the black-white type but are otherwise exhibiting a behavior similar to the convex case. In Fig. 5 we start from \(\rho_i=\overline{\rho}\) and test different values of d . The normalized displacements are from top to bottom 1, 0.7562 and 0.5478.

Fig. 5
figure 5

The influence of the plasticity parameter d when c = d + = 0, we start from an initial distribution of \(\rho_i=\overline{\rho}\) for all elements, and q = 3. From top to bottom we have set d equal to 0, 0.5 μ and 0.8 μ

Fig. 6
figure 6

The influence of the viscosity parameter c when d + = 0,d  = 0.5 μ, we start from an initial distribution of \(\rho_i=\overline{\rho}\) for all elements, and q = 3. From top to bottom we have set c equal to \(0, 10^{-14}\Updelta t\) and \(10^{-12}\Updelta t\)

The similar problem when starting from \(\rho_i=\underline {\rho}\) shows the expected behavior that a higher value of d + produces a thinner structure but the topology is the same in all calculations.

Finally, we study the influence of the parameter c in the non-convex case. We start again from a full distribution \(\rho_i=\overline{\rho}\) and use the same values for c as in the convex case. The normalized displacements from top to bottom become 1, 1,004 and 1,1586. The lower picture, representing the largest viscosity, shows quite a different behavior from the other solutions. Clearly, a sufficiently large viscosity smooths out the solution and does not give a black-white solution.

5 Conclusions and discussion

The connection between certain bone remodeling theories and a density approach to topology optimization, which was previously discussed in Klarbring and Torstenfelt [15, 16], has been taken one step further in the present paper, showing how more refined bone remodeling theories, e.g., involving a lazy zone, fits into a dynamical systems approach to optimization. The well-known Coleman–Noll procedure of rational thermodynamics turns out to be applicable in the derivation of dynamical systems. This is seen essentially by letting the objective function play the role of a thermodynamic free energy. The resulting modeling approach is flexible and by making particular choices for the objective function and the dissipation function particular remodeling theories can be obtained, one such theory is demonstrated to involve the lazy zone context. Moreover, it is shown that the lazy zone model is related to elements of plasticity and viscosity in the growth process.

Furthermore, we show how the general idea of linearizing in an intermediate variable, well known in structural optimization, can be used in obtaining an algorithm for the solution of the dynamical system. An extensive set of numerical tests indicate the effect of different parameters involved. In particularly, we find that inclusion of viscosity tends to smooth out an otherwise black and white solution.

The discussion and developments of this paper was limited to static loading, since our main goal was to show the inclusion of the lazy zone concept into our previously developed theory. However, in [16] we have shown how to use time dependent loads and a time dependent goal function. In fact, in that paper we also discussed the possibility of treating cyclic loading by means of several simultaneous load cases. Obviously, such cyclic loading, arising typically in walking, is important in bone remodeling calculations. Although, this theory of time dependent loading was presented in the context of the equation \({R}_i={k}_i\dot{\rho}_i\), instead of (9), it is easily extended to this later case.

Finally, we note that although the problems discussed in this paper are obviously test problems, chosen to demonstrate the impact of different modeling parameters, the general approach is not limited to simple geometries in two dimensions. This has been amply demonstrated in the topology optimization literature and by the existence of several widely used commercial programs. In the context of bone remodeling, the recent paper by Boyle and Kim [2] shows that three-dimensional bone remodeling calculations for real geometries are possible.