Approximations of energy minimization in cell-induced phase transitions of fibrous biomaterials: $\Gamma$-convergence analysis
Georgios Grekas, Konstantinos Koumatos, Charalambos Makridakis and, Phoebus Rosakis

TL;DR
This paper develops a new mathematical framework for approximating energy minimization in fibrous biomaterials undergoing phase transitions, ensuring convergence of numerical solutions to the true continuous model using $ ext{Γ}$-convergence and Orlicz spaces.
Contribution
It introduces a novel approach to $ ext{Γ}$-convergence for discontinuous Galerkin methods applied to complex energy minimization problems in nonlinear elasticity.
Findings
Discrete minimizers converge to continuous minimizers as discretization refines
A new $ ext{Γ}$-convergence approach for lower regularity spaces
Development of an Orlicz space framework for penalized interpenetration terms
Abstract
We consider a model of energy minimization arising in the study of the mechanical behavior caused by cell contraction within a fibrous biological medium. The macroscopic model is based on the theory of non rank-one convex nonlinear elasticity for phase transitions. We study appropriate numerical approximations based on the discontinuous Galerkin treatment of higher gradients and used succesfully in numerical simulations of experiments. We show that the discrete minimizers converge in the limit to minimizers of the continuous problem. This is achieved by employing the theory of -convergence of the approximate energy functionals to the continuous model when the discretization parameter tends to zero. The analysis is involved due to the structure of numerical approximations which are defined in spaces with lower regularity than the space where the minimizers of the continuous…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Mathematical Modeling in Engineering · Composite Material Mechanics · Elasticity and Material Modeling
Approximations of energy minimization in cell-induced phase transitions of fibrous biomaterials:
-convergence analysis
G. Grekas Aerospace Engineering and Mechanics, University of Minnesota, Minneapolis, USA.
K. Koumatos Department of Mathematics, University of Sussex.
C. Makridakis44footnotemark: 4 22footnotemark: 2 Department of Mathematics and Applied Mathematics, University of Crete.
P. Rosakis33footnotemark: 3 Institute of Applied & Computational Mathematics, Foundation for Research & Technology-Hellas
Abstract
We consider a model of energy minimization arising in the study of the mechanical behavior caused by cell contraction within a fibrous biological medium. The macroscopic model is based on the theory of non rank-one convex nonlinear elasticity for phase transitions. We study appropriate numerical approximations based on the discontinuous Galerkin treatment of higher gradients and used succesfully in numerical simulations of experiments. We show that the discrete minimizers converge in the limit to minimizers of the continuous problem. This is achieved by employing the theory of -convergence of the approximate energy functionals to the continuous model when the discretization parameter tends to zero. The analysis is involved due to the structure of numerical approximations which are defined in spaces with lower regularity than the space where the minimizers of the continuous variational problem are sought. This fact leads to the development of a new approach to -convergence, appropriate for discontinuous finite element discretizations, which can be applied to quite general energy minimization problems. Furthermore, the adoption of exponential terms penalising the interpenetration of matter requires a new framework based on Orlicz spaces for discontinuous Galerkin methods which is developed in this paper as well.
1 Introduction
Increasingly sophisticated mathematical techniques are needed in order to describe biological phenomena. Biological cells severely deform the fibrous collagen extracellular material (ECM) around them in remarkable ways, causing the formation of complex microstructures of highly localized deformation [33, 52]. In [32], this phenomenon, known as mechanical remodelling of the ECM, is modelled at a macroscopic level, as a phase transition in a nonlinear elastic material with a multi-well energy. The nonconvexity is due to buckling instability of ECM fibers at the microsopic level. Subsequently, computational predictions based on the mathematical model, combined with targeted experiments, lead for the first time to understanding the mechanisms of the observed ECM remodelling. The latter facilitates intercellular communication through the formation of tethers, regions where a densification phase transition takes place, joining distant contracting cells. The associated variational problem involves a non rank-one convex strain-energy function, regularized by a higher gradient term.
Here, our objective is to mathematically justify the above procedure, by showing that appropriate numerical approximations, based on the discontinuous Galerkin treatment of higher gradients, and used very successfully in computational experiments, indeed converge in the limit to minimizers of the continuous problem. This is done by employing the theory of -convergence of the approximate energy functionals to the continuous model when the discretization parameter tends to zero. This is a rather involved task due to the structure of numerical approximations, which are defined in spaces with lower regularity than the space where the minimizers of the continuous variational problem are sought.
Our work has a number of methodological advances which go beyond the scope of the particular application. In fact, within the field of nonlinear PDEs with possibly singular solutions, calculus of variations and energy minimization has received a lot of attention from the analysis point of view. Although quite interesting and challenging, the numerical analysis of these problems is much less developed, a variety of approaches are discussed in, e.g., [6, 7, 20, 41, 46] and their references. Key issues, related to the design of computational algorithms, their analysis, selection criteria among possible solutions and minimizers remain largely unexplored. Our work contributes to scheme design and analysis of such problems. The problem considered is a typical nonlinear energy minimization problem which admits solutions exhibiting phase transitions. We show that a good scheme design strategy is to regularise at the discrete level the continuum energies by higher order gradients. The regularisation at the discrete level considered is of similar nature to the artificial diffusion in conservation laws and it appears that it enjoys remarkable properties in terms of computational robustness and analytical consistency. Compared to other approaches, such as relaxation, [7], the regularisation by higher gradients has certain distinct desirable characteristics. Computing with the relaxed energy, assuming that we can obtain it, smears over the multiphase mixture (microstructure) or oscillations, which in certain applications (including ours) are very physical as they are observed in experiments. Furthermore, when microstructures appear, quite often a mathematical quantity of interest is an underlying parametrized Young measure. The regularisation parameter sets an upper bound to the frequency of the oscillations and thus allows micro-phenomena to be present in a computationally accessible way; thus such oscillations (not necessarily extremely fine) may provide approximations to the underlying Young measure. The discretization of higher gradients is done using the discontinuous Galerkin framework, thus retaining the regularity of only conforming elements. This natural approach on the other hand poses new challenges in the analysis of schemes. New ideas are needed in the -convergence analysis due to the lack of conformity at the higher-gradient spaces. The adoption of exponential terms penalising the interpenetration of matter requires a new framework based on Orlicz spaces for discontinuous Galerkin methods, developed in this paper as well.
Soon after a preprint version of this work was published [31], a related preprint [10] appeared, which also treats -convergence of the discetized energy from a nonconvex mechanics problem, using totally discontinuous finite elements (these two works were developed independently of each other). Apart from this similarity, there are substantial differences in both the model and the discretization that set these papers apart.
The model. We consider the problem of minimizing the total potential energy
[TABLE]
where the displacement and satisfies some appropriate boundary conditions, is the strain energy function, is a function that penalizes the interpenetration of matter and is allowed to grow faster than as the volume ratio approaches zero, and is a fixed real parameter (higher gradient coefficient). The energy involves a non rank-one convex strain-energy function, regularized by a higher order term. The penalty term is important since, although it permits the appearance of phase transitions, it prevents interpenetration of matter from taking place. The strain energy function models the bulk response of the collagen ECM, while the higher order term represents a length scale for the thickness of phase transition layers and the emerging two-phase microstructures. Specifically, the strain energy function models the mechanical response of the ECM which is a collagen material in the form of a random network of fibers at the microscopic level. Biological cells, such as fibroblasts, are embedded in the ECM. They are attached onto the ECM fibers through proteins known as focal adhesions. Through these molecules, cells can detect mechanical alterations to their microenvironment and can deform the surrounding ECM. Cells typically deform the ECM by actively contracting. These tractions are observed to create distinct spatial patterns of localized, severe densification in the ECM between cells, forming a tether connecting them, and around the periphery of the cell in the form of hair-like microstructures, [33, 52, 45, 32]. These microstructures and the associated strain oscillations are strongly reminiscent of fine phase mixtures in the theory of nonlinear elasticity for phase transitions [5, 4]. This similarity was explained in [32] where a model for the strain energy density was obtained via multiscale modelling from the stress-strain behavior of single fibers comprising the bulk ECM material, as summarized below in section 8. The central physical observation related to instability and phase change [38] is that individual collagen fibers can sustain tension, but buckle and collapse under compression. At the microscopic level, this is accounted for as an effective softening behavior in uniaxial compression of fibers in our model. The macroscopic behavior is obtained by averaging over a uniform distribution of fiber orientations. This results in a strain energy function that loses rank-one convexity, and is essentially equivalent to a multi-well potential corresponding to a densification phase transition at the continuum scale. The phases correspond to low- and high-density states and their simulation via energy minimization leads to a remarkable agreement with experimental observations of densification microstructures (an example of an experiment is shown in Figure 5a; the corresponding simulation is shown in Figure 5b). These microstructures are composed of tethers, or relatively straight bands joining different cells, and hairs, thinner multiple bands emanating radially from each cell and tapering off into the ECM. The ECM density within both tethers and hairs can be 3-5 times larger than outside them.
Failure of rank-one convexity implies a loss of ellipticity of the Euler-Lagrange PDEs of the corresponding energy functional. For a wide class of similar problems it is known [5, 4] that there exist oscillatory minimizing sequences with finer and finer microstructures involving increasing numbers of strain jumps. Similar behavior is observed in our model; the numerical approximations—obtained by mesh refinement—of terms of increasing fineness in the minimizing sequences, involve more and thinner hairs (see Figures 1a-1d). They also bear strong similarity with experiments [32].
The higher gradient term in (1.1) regularises the corresponding total potential energy, keeping the aforementioned minimizing sequences from having arbitrarily fine structure (see Figure 3 for numerical examples).
To the best of our knowledge, the deformations observed in [32] and in the present study are the first examples of minimizing sequences in a multi-well compressible isotropic material.
Approximations and results. The approximation of minimizers of is quite subtle. A straightforward approach would be to seek approximate minimizers in the space of conforming finite elements, i.e. of discrete function spaces which are finite dimensional subspaces of . Such spaces are based on elements which require regularity across element interfaces, e.g. Argyris elements [14]. However, the conformity in regularity has a very high computational cost under the minimization process and in addition results in much more complicated algorithms as far as the implementation is concerned. Our choice is to use the framework of the discontinuous Galerkin method. In effect this weakens the regularity of the approximating spaces, and counterbalances the resulting nonconformity, by amending appropriately the discrete energy functional. Motivated by the analysis in [43], we introduce an approximate energy which is compatible with finite element spaces, and thus requires only regularity. Corresponding finite element methods, known as -interior penalty methods, have been introduced previously for the approximation of the biharmonic equation in [16, 27]; see also [2] for fully discontinuous finite element methods.
Here we study the convergence of discrete absolute minimizers. Specifically, let be a sequence of absolute minimizers for the discretized energy functional , namely
[TABLE]
Equation (1.2) indicates that, for a fixed , is an absolute minimizer of . Therefore, as , it is natural to ask whether in , where is an absolute minimizer of the continuous problem (1.1). Note that and . To answer this question we assume first that the penalty function has polynomial growth. Then the convergence result is given in Theorem 6.1, where we have employed the theory of convergence and discrete compactness results. The analysis is rather involved due to the lack of regularity of the approximate spaces. A -convergence result for discrete surface functionals involving high gradients using conforming finite element spaces can be found in [6]. Assuming that the penalty term has exponential growth, extra embedding results are needed to show that converges to . For this purpose, it is crucial to use an adaptation of Trudinger’s embedding theorem for Orlicz spaces [53], to the piecewise polynomial spaces admitting discontinuities in the gradients, Theorem 7.1. The analysis in this case is carried out in Section 7. It is to be noted that in our approach we are interested in the limit for any fixed The tools to address the very interesting case for rather general non rank-one convex functionals as considered herein, are currently not available. In addition, we remark that the case where as is currently beyond our reach.
The present work addresses key technical issues related to the analysis of approximations of energy minimization problems involving higher gradients. A main technical obstacle in proving -convergence is the fact that the approximating discrete energy functionals are defined in spaces of lower regularity compared to the limiting functional as a result of the discontinuous Galerkin formulation. Notice here that from a computational perspective the use of elements permits direct comparisons with the approximations obtained even in the limit case In our analysis we use certain recovery operators for the higher gradients, well known in the analysis of discontinuous Galerkin methods. As such, previous results from [19, 25] are useful. Notice that compared to the method in [19] where recovery operators were used in the definition of the discretization method as well, our method leads to the natural discontinuous Galerkin method, in the sense that the part corresponding to the higher gradients in the energy introduced herein has as first variation the bi-linear form used in [16]. As mentioned, to treat exponential penalty terms in the energy functional we need to develop an appropriate discontinuous Galerkin framework in Orlicz spaces (Section 7). To this end, results of [35] for averaging operators have proven useful.
This paper is organized as follows. In section 2 we discuss some properties of the continuum problem, a lower bound is proved and the minimization problem is stated. In section 3 the necessary notation, some standard finite elements results, the discrete total potential energy and lifting operators used in the next sections are introduced. Equi-coercivity, the and the inequalities are proved for the discrete energy functional in section 5, which imply . From the -convergence result and a discrete compactness property we deduce the convergence of the discrete absolute minimizers, section 6. In section 7 the same convergence result is established when the penalty function has exponential growth. In this section we derive key embeddings of broken polynomial spaces into an appropriate Orlicz space. We conclude with section 8 illustrating some computational results which demonstrate the robustness of the approximating scheme and the model when both the mesh discretization parameter and vary.
2 The Continuum Problem
We assume the following bounds for the terms in equation (1.1)
[TABLE]
for some and positive constants . Also, we will assume that the penalty term satisfies the conditions
[TABLE]
again for some and positive constants .
To define a minimization problem we should declare appropriate boundary conditions. We specify a globally injective, orientation preserving . We encode boundary conditions in the following set:
[TABLE]
Notice that the boundary conditions were chosen for analytical convenience only. A variety of other boundary conditions can be treated with appropriate modifications in the finite element analysis, see Remark 3.1. Now, the minimization problem can be defined as:
[TABLE]
To ensure that the total potential energy has a minimizer , one can prove that is coercive and lower semicontinuous. The former can be derived from the properties of the strain energy function, i.e. (2.1), and the Poincaré inequality. One way to prove the latter is to show convergence of the lower order term using Theorem and the convexity of the higher order term. To avoid repeating similar proofs, these ideas will be used to show that an appropriate discretization of the energy functional converge to the continuous total potential energy. Then, using a discrete compactness result we deduce that admits a minimizer using the Fundamental Theorem of convergence [12, 11].
3 Discretization
3.1 Notation
Here we assume for simplicity that the domain is polygonal and, henceforth, denotes the triangulation of the domain with mesh size . For , a triangle, is the diameter of and the mesh size is then defined as . The space of polynomials defined on with total degree less than or equal to is denoted by . Next we will require the partitions of the domain to be shape regular [14], i.e., there exists such that
[TABLE]
where is the diameter of the largest ball inscribed in .
The boundaries of the elements comprise the set of mesh edges . The set is partitioned into , the boundary, and , the internal edges, such that and . For all there exist two distinct elements, we denote them and , such that . Similarly, if , there exists one element such that .
For an edge we denote by its length. Assuming shape regularity it can be shown that there exist constants independent of the mesh size , such that
[TABLE]
To discretize the continuous functional we need to first define our finite element spaces. We use continuous and discontinuous families of Lagrange elements. Consider the space of continuous piecewise polynomial functions , viz.
[TABLE]
Also consider the discontinuous finite dimensional space
[TABLE]
We know that . However, and thus describing (1.1) over will require the introduction of penalty and jump terms in the discrete functional. Notice that for we have . In the sequel, we shall use the following notation: The trace of functions in belong to the space
[TABLE]
where we recall that is the set of mesh edges. The average and jump operators over for and are defined by:
[TABLE]
[TABLE]
[TABLE]
where , are the elements that share the internal edge ; are the corresponding outward normal to the edge and is a third order tensor with . Since the boundary terms encode implicitly the boundary conditions we prefer to define them below, see (2.2j). We employ the usual summation convention, e.g. ; also subscripts preceded by a comma indicate partial differentiation with the respect to the corresponding coordinate, e.g. .
3.2 Discretization of the Energy functional
A direct discretization of the minimization problem (1.1) would require an approximation space, a subspace of . This means that, for conforming finite elements, we would require continuity at the interfaces, i.e. across element internal boundaries. It is well known that the construction of elements that ensure continuity is quite complex. Here we adopt to our problem an alternative approach based on the discontinuous Galerkin formulation. Our approximations will be sought on however the energy functional should be modified to account for possible discontinuities of normal derivatives at the element faces. The appropriate modification of the energy functional proposed below is motivated by the analysis in [43]; the resulting bilinear form of the biharmonic operator obtained via the first variation, will be the form of the discontinuous Galerkin method for the linear biharmonic problem, introduced in [27].
The discretized functional for , , has the form:
[TABLE]
where the functional contains the higher order terms. For the boundary faces we use the notation:
[TABLE]
where is given in (2.2c), is the standard nodal interpolation operator in (2.2d) and the outward normal on Note that the stabilization term is independent of because . Although the boundary condition on is encoded implicitly in the discrete functional through (2.2j), the boundary condition on is enforced explicitly in the discrete space:
[TABLE]
where From now on we shall use the convention that for elements of the jumps on the boundary faces are given through (2.2j). So, we have to solve the corresponding discrete minimization problem
[TABLE]
Clearly . On the other hand, does not exist as a function in and it can be defined only in the piecewise sense at the element level, i.e. {\left.\kern-1.2pt\nabla\nabla\bm{u}_{h}\vphantom{\big{|}}\right|_{K}}\in\mathbb{P}_{q-2}(K).
Remark 3.1** (Alternative boundary conditions).**
Modeling and simulations of experimental results do not require strict boundary conditions of the function and its derivative. It is observed in the experiments, that when cells contract and pull the ECM fibers, they deform inhomogeneously and change shape under inhomogeneous forces. A minimal model for this deformation has been employed in [32], where the boundary of the cell is connected to the ECM with linear springs. This contributes to the continuous model energy the term
[TABLE]
where is the stiffness constant and are the boundaries of the cells. See [32, 5.2.2. Model for active particles] for more details. For large enough values of , the above term can model Dirichlet type boundary conditions, in the sense that the displacement is imposed by a stiff linear spring, which is perhaps closer to the experimental approach than the explicit enforcement of the boundary conditions. Then, our analysis remains valid, where now , and the terms involving boundary edges in (2.2i) and elsewhere are excluded.
4 Preliminary results
4.1 Preliminary results for finite element spaces
For convenience we briefly state some preliminary results on the finite element spaces which will be useful in the sequel. Following partially the notation of Brenner & Scott, [14], let and, for , define the function by . Then is equivalent to and
[TABLE]
Next we state the well known trace inequality:
Lemma 4.1**.**
Assume that is bounded and has a Lipschitz boundary. Let , . Then there exists a constant depending only on and such that
[TABLE]
In general one can have an estimate of the above constant, for instance if is the unit disk in and then , see [14]. We state the discrete trace inequality which is a consequence of Lemma 4.1 and of (2.2a).
Lemma 4.2** (Discrete Trace Inequality).**
Let be a shape regular triangulation. Then, there exists a constant independent of , but depending on , such that
[TABLE]
The standard nodal interpolation operator will be denoted by , where
[TABLE]
Next some well known interpolation error estimates are presented.
Lemma 4.3**.**
Let , with , be a shape-regular triangulation of the domain . If , where is the smallest integer value greater than or equal to , then there exists a constant depending only on the domain , a shape parameter of the triangulation and such that
[TABLE]
where denotes the diameter of the element .
Using the trace inequality (2.2b) we obtain the error estimates for norms defined on the mesh edges.
Corollary 4.1**.**
If the assumptions of Lemma 4.3 hold, then for a face of an element , i.e. we have the following error estimate of the integral over :
[TABLE]
4.2 Poincaré Inequalities for Broken Sobolev Spaces
To bound in higher order norms we will need Poincaré inequalities for broken Sobolev spaces. For this purpose we define the broken Sobolev seminorm for :
[TABLE]
Since is an open, connected and bounded set with Lipschitz boundary, the main result in [39] and in [15] implies that
[TABLE]
for all , where can take any of the following forms
[TABLE]
The constant depends on the minimum angle of the triangles, , and . We have assumed that the family of partitions is shape regular, consequently is independent of , see [39] for details.
4.3 Lifting and the Discrete Gradient Operators
We adopt in our case of the discontinuous gradient the results of [8, 18] regarding Lifting and Discrete gradients.
Definition 4.1** (The vectorial piecewise gradient).**
Let , . The vectorial piecewise gradient is defined componentwise as
[TABLE]
Consequently for all , and
[TABLE]
For all we define the linear operator, known as lifting operator [8, 18], , for all as follows
[TABLE]
It can be shown that is non zero only on the elements that contain on their boundary, i.e. . We also define the global lifting operator
[TABLE]
With the help of this operator we can represent the second term of the functional , see (2.2i), as an integral over ; namely,
[TABLE]
Since , we can substitute by to obtain
[TABLE]
where recall that at the boundary faces we use the convention and
We next define the discrete gradient , which is a combination of the vectorial piecewise gradient and the global lifting operator. In particular, the discrete gradient of is defined as
[TABLE]
Later we will show under which conditions in , when in as . For this reason it will be convenient to write the higher order derivatives of the discrete total potential energy in terms of the discrete gradient and the global lifting operator. We do this in Lemma 4.4 below which will be useful in the sequel.
Lemma 4.4**.**
The higher order terms of the discretized total potential energy can be written in terms of the discrete gradient and the global lifting operator, as follows
[TABLE]
Proof.
The proof follows from Definition 4.1 and equation (2.2n). ∎
From Lemma 4.4 the functional , displayed in (2.2i), becomes
[TABLE]
Using inverse inequalities (2.2c), one can show, see [18], that there exists a positive constant , independent of h, such that
[TABLE]
This bound finally implies the next Lemma, see [26, Lemma 4.34] and [19, Lemma 7] for details.
Lemma 4.5** (Bound on global lifting operator).**
For all there holds
[TABLE]
where the constant depends on the constant of (2.2r).
Corollary 4.2** (Bound on Discrete Gradient).**
There exists a constant such that for all it holds that
[TABLE]
4.4 Analytical preliminaries
In the subsequent sections we examine the convergence of the lower order terms in , i.e. the terms and of (2.2i), when in . For this purpose we employ Vitali’s convergence theorem [49].
Theorem 4.1** (Vitali convergence theorem).**
Let be a set of finite measure and be a sequence of functions in . Assume is uniformly integrable over , i.e., for each , there exist independent of such that If pointwise a.e. on , then and
[TABLE]
We now state a useful criterion of uniform integrability, known as the de la Vallée Poussin criterion, [9, Theorem 4.5.9].
Theorem 4.2** (de la Vallée Poussin criterion).**
A family , is uniformly integrable if, and only if, there exists a non-negative increasing function on such that
[TABLE]
5 Convergence of the discretization
In this section we establish the -convergence of the discretized functionals to the continuum energy . The proof consists of three parts: we first prove equi-coercivity, a necessary property to bound the sequence when the family of discrete energies is bounded. Then, we show the inequality which provides a lower bound of the discrete energies by the continuum counterpart. We conclude with the inequality which, as we will see in Section 6 ensures the attainment of the limit.
5.1 Equi-Coercivity and Convergence of the Discrete Gradient
Proposition 5.1** (Equi-coercivity).**
Assume that , i.e. the penalty parameter in (2.2i) is greater than the constant of Proposition 4.5. Let be a sequence of displacements in such that for a constant independent of it holds that
[TABLE]
Then the there exists a constant such that
[TABLE]
In addition,
[TABLE]
for a positive constant , where are independent of .
Proof.
We have shown, see (2.2i) and (2.2q), that can be written in terms of the discrete gradient and the lifting operator . From the assumption and the bound of the global lifting operator in (2.2s), we see that is nonnegative:
[TABLE]
In particular,
[TABLE]
By (2.1) it holds , is a positive constant, and is a nonnegative penalty parameter, consequently
[TABLE]
From the assumption that is uniformly bounded over , i.e. for all , we obtain that all terms appearing in the right hand sides of (2.2d) and (2.2e) are uniformly bounded. Therefore, using the bound of the global lifting operator, (2.2s), we conclude that
[TABLE]
and
[TABLE]
It remains to show that is uniformly bounded, using that . By the coercivity condition on given in (2.1), equation (2.2e) gives
[TABLE]
where we have used the Cauchy-Schwarz and Young’s inequality. Choosing, for example, , we infer that and the proof is concluded by Poincaré’s inequality. ∎
5.2 The inequality
Lemma 5.1** (Convergence of the lower order terms).**
Let in , with and . Suppose further that
[TABLE]
where is independent of . Then, up to a subsequence,
[TABLE]
Proof.
From the assumption in there exists a subsequence, not relabeled, such that a.e. Note that , see (2.1), is bounded from above. Specifically
[TABLE]
for some . Since is bounded in all norms, by (2.2k), this implies that is uniformly integrable and from Vitali’s Theorem 4.1 must converge to in . ∎
Remark 5.1** (Convergence of the penalty term).**
From inequality (2) the penalty term is bounded from above, i.e.
[TABLE]
Then as in Lemma 5.1 , as up to a subsequence.
Lemma 5.2**.**
Let in , with . If is uniformly bounded with respect to , then
[TABLE]
Proof.
This proof is an adaptation of the proof in [25, Theorem 2.2]. Let , then from the definition of the piecewise gradient, equation (2.2j), and the divergence theorem, we obtain
[TABLE]
where we recall that .
First, we show that the last two terms convergence to [math] as . To this end, let be the piecewise average operator onto , i.e. {\left.\kern-1.2pt\bar{I}^{0}_{h}\bm{\phi}\vphantom{\big{|}}\right|_{K}}=1/|K|\int_{K}\bm{\phi}, and define . Then from standard error estimates, see e.g. [26, Lemma 1.58],
[TABLE]
Now, using the definition of , see (2.2m), for the last two terms of (2.2o) we obtain
[TABLE]
The assumption that is bounded for all , implies that is also uniformly bounded. Also, from Proposition 4.5 the global lifting operator is bounded from the jump terms, inequality (2.2s). As a result,
[TABLE]
and is uniformly bounded in the norm. From the last relation and the Cauchy-Schwarz inequality we bound :
[TABLE]
Hence, , as by the error estimate given in (2.2p). Similarly for the term , using the previous uniform bound for the jump terms, the error estimate for integrals that are defined over an edge , (2.2f), and letting , we infer that
[TABLE]
Since in , taking the limit as , employing (2.2s) and (2.2t), the relation (2.2o) implies
[TABLE]
∎
Corollary 5.1**.**
*(Weak Convergence of the Discrete Gradients).
Suppose the assumptions of Lemma 5.2 hold. In addition assume that , then*
[TABLE]
Proof.
Lemma 5.2 ensures the limit of equation (2.2n) for all , hence
[TABLE]
∎
Theorem 5.1** (The inequality.).**
Assume that , i.e. that the parameter of the discrete energy function is larger than the constant of (2.2s). Also, let the penalty term satisfy condition (2). Then for all and all sequences such that in it holds that
[TABLE]
Proof.
We assume there is a subsequence, still denoted by , such that uniformly in , otherwise . The following steps conclude the proof:
From Proposition 5.1, the uniform bound implies that and are uniformly bounded. 2. 2.
Corollary 5.1 implies in . 3. 3.
The term is convex which implies weak lower semicontinuity [21]: . 4. 4.
From the Poincaré inequality for broken Sobolev spaces, (2.2h), there exist a constant independent of such that for all it holds
[TABLE]
where the last bound holds from step 1. 5. 5.
Finally, the assumed convergence of to in , Lemma 5.1 and Remark 5.1 ensure the convergence of the remaining terms, i.e. .
As a result we deduce that . ∎
5.3 The inequality
In this section we focus on the inequality. Given , we would like to prove the existence of a sequence , such that in and as . To this end, choose a sequence of smooth functions such that in and we define to be an appropriate interpolant of , , for a chosen . A similar strategy was used in [6]. We start with the following Proposition:
Proposition 5.2**.**
For , if and , there exist constants such that
[TABLE]
Proof.
To simplify the notation let . First we study (2.2y). Adding and subtracting the term , using the error estimates of Corollary 4.1, yields
[TABLE]
where denote the distinct elements that share the edge , i.e. . Summing over all edges inequality (2.2aa) gives
[TABLE]
To prove (2.2z) notice that
[TABLE]
The Cauchy Schwarz inequality and the discrete trace inequality (2.2c) imply
[TABLE]
Therefore
[TABLE]
However,
[TABLE]
where we have used the error estimates of (2.2e). Consequently (2.2ae) becomes
[TABLE]
Similarly we show that
[TABLE]
∎
Theorem 5.2** (The inequality.).**
Let the penalty function satisfy condition (2). The following property holds: For all , there exists a sequence with , such that in and
[TABLE]
Proof.
Given we construct an appropriate sequence , the recovery sequence, such that and .
In particular, we approximate via mollification by a sequence of smooth functions in to find that, for all , there exists such that
[TABLE]
Recall, and on , where by the definition of . Here is independent of .
Next, define , noting that . From the error estimates in (2.2e) and the fact that we find that
[TABLE]
Inequality (2.2aj) and the error estimate of (2.2ak) imply that
[TABLE]
Choosing
[TABLE]
we deduce that the sequence and in , as . It remains to prove
[TABLE]
For the convergence of the lower order terms we use Lemma 5.1 and Remark 5.1. Hence, it suffices to show that , is uniformly bounded with respect to . Indeed, Sobolev’s embedding theorem and classical error estimates, see inequality (2.2al), imply that is uniformly bounded in with respect to , for all :
[TABLE]
To extend the bound over , assume that is integer and ; then the multinomial formula implies
[TABLE]
The result can be extended for because and for using the interpolation bound, [17]:
[TABLE]
where are the floor and ceiling integer functions respectively and . Notice that Lemma 5.1 and Remark 5.1 give
[TABLE]
in , as . Also, since we have choosen , Proposition 5.2, (2.2aj), implies that as
[TABLE]
For the boundary terms we have:
[TABLE]
Similarly,
[TABLE]
For the remaining higher order terms, we work similarly as before. We begin, showing an inequality for a given element using the error estimates of (2.2al) and (2.2am):
[TABLE]
Then summing over in and using the Cauchy-Schwarz inequality, gives:
[TABLE]
, where for the last inequality we have used (2.2aj) and (2.2ao). Furthermore, note that
[TABLE]
Finally (2.2aw) and (2.2ax) give
[TABLE]
which concludes (2.2ap). ∎
6 Compactness and Convergence of Discrete Minimizers
In this section our main task is to use the results of the previous section to show that under some boundedness hypotheses on , a sequence of discrete minimizers converges in to a global minimizer of the continuous functional, Theorem 6.1. Such results are standard in the convergence literature, [11, 22], but the application in our setting is not straightforward. The main reason is that in our case we need certain intermediate results, such as a discrete DG version of the Rellich-Kondrachov theorem, which we show in the sequel. We use related discrete bounds derived previously in [40, 29, 25, 19]
We will use the total variation of a function , see [28], defined as
[TABLE]
The space of functions of bounded variation in , denoted by , contains all functions with bounded total variation, i.e.,
[TABLE]
The space is endowed with the norm . The following inequality plays a key role in the desired compactness.
Lemma 6.1** (Bounds for the total variation).**
Let . Then, there exist a constant independent of such that
[TABLE]
A proof can be found in [40, Theorem 3.26] and a generalization in ([19, Lemma 2]. It is based on the observation
[TABLE]
where and appropriate bounds on the right-hand side.
Proposition 6.1** (Discrete Rellich-Kondrachov).**
Let a sequence be bounded, for , as
[TABLE]
Then is relatively compact in for , i.e. there exists a such that
[TABLE]
up to a subsequence.
Proof.
Using the Sobolev embedding theorem, the discrete Poincaré inequality (2.2h) and inequality (2.2e) we conclude that
[TABLE]
uniformly with respect to , for all , where is a positive constant independent of . The space is reflexive for . Therefore, for every bounded sequence there exists a subsequence, not relabeled, and a function such that
[TABLE]
From the Rellich-Kondrachov theorem, [17, Theorem 9.16], and since , it is known that , i.e. it is compactly embedded for . In particular, in for .
It remains to prove that is relatively compact in . Similar results have been proved in [25, 19, 29], all of them are based on a bound of the norm, , from the higher order terms. To this end, from inequalities (2.2c) and (2.2e) it follows that is uniformly bounded in . By standard embedding theorems, see for example [28, Theorem 5.5], in is relatively compact in and, up to a subsequence, there exists such that
[TABLE]
Therefore, from the interpolation inequality, [17], and (2.2g), we obtain that
[TABLE]
where and . From (2.2h) we conclude that in for . ∎
The discrete Rellich-Kondrachov Theorem ensures that there exist in such that in under some boundedness hypotheses on . However, the proof that minimizers of the discrete problem converge to a minimizer of the continuous problem would require higher regularity on , i.e. . Similar arguments were used previously in [25, 19].
Proposition 6.2** **(Regularity of the limit and Weak Convergence of the Discrete
Gradient).
Let a sequence with in . If the sequence is bounded in the seminorm, then
[TABLE]
*up to a subsequence. In addition, . *
Proof.
Here we adopt partially the proof of [25]. From inequality (2.2t), the discrete gradient is bounded by in the norm. Hence, there exists such that, up to a subsequence,
[TABLE]
To prove that , let . By Lemma 5.2
[TABLE]
which means that .
It remains to prove that . If then {\left.\kern-1.2pt\bm{u}_{h}\vphantom{\big{|}}\right|_{\partial\Omega}}={\left.\kern-1.2pt(I^{q}_{h}\bm{g})\vphantom{\big{|}}\right|_{\partial\Omega}} and . Classical interpolation error estimates, see inequality (2.2f), give
[TABLE]
Combining the last result with the trace inequality yields
[TABLE]
which means a.e on . For the term we first notice that
[TABLE]
On the other hand, Lemma 4.1 implies ( is the element with boundary face )
[TABLE]
The proof is thus complete. ∎
Theorem 6.1** (Convergence of discrete absolute minimizers).**
Assume that , i.e. that the stabilization parameter is greater than the constant of (2.2s). Let be a sequence of absolute minimizers of , i.e.,
[TABLE]
If is uniformly bounded then, up to a subsequence, there exists such that
[TABLE]
Remark 6.1**.**
We note that for each fixed the functional admits a minimizer. Indeed, given an infimising sequence in the finite-dimensional space , by coercivity (Proposition 5.1) and the Poincaré inequality (2.2h), it must be bounded in the norm
[TABLE]
Finite-dimensionality of implies strong convergence of the infimising sequence in the above norm and it is easy to check that the functional is continuous with respect to this convergence.
Proof of Theorem 6.1.
The uniform bound for the discrete energies implies from the equi-coercivity property, Proposition 5.1, that
[TABLE]
uniformly with respect to . The discrete Rellich-Kondrachov, Proposition 6.1, ensures that there exists such that in up to a subsequence not relabeled here. Since is uniformly bounded, Proposition 6.2 implies that and also .
To prove that is a global minimizer of we use the and inequalities, Theorems 5.1 and 5.2 respectively. Let , then the inequality implies that there exist such that
[TABLE]
Therefore, since in the inequality and the fact that are absolute minimizers of the discrete problems imply that
[TABLE]
for all . Therefore is an absolute minimizer of . ∎
7 Incorporating Penalty terms with Exponential Growth
So far we have shown the convergence of discrete absolute minimizers to a global minimizer of the continuous problem. The proof is based on the convergence of to and on discrete compactness results. To penalize interpenetration of matter we have added a penalty function in the total potential energy (1.1), assuming that has polynomial growth, see (2). One can notice that the polynomial growth penalizes also deformations where , is the Jacobian determinant of the mapping, and as a consequence can affect the material properties.
Using a penalty of the form
[TABLE]
for large enough , the penalty parameter contributes to the total potential energy when , thus an assumption as (2.2a) seems preferable. In addition, computational results related especially to densified phase and its comparison to experimental data indicates that (2.2a) is a better choice, for more details see [30].
In this section we will assume that instead of polynomial growth, (2.2a) holds. However, employing a penalty function with exponential growth, affects the proofs of the inequalities , Theorem 5.1, and , Theorem 5.2. The main technical difficulty addressed in this section is the proof of the inequality when (2.2a) is assumed. To show the analog of Theorem 5.2, and in particular that is uniformly integrable one has to use appropriate Orlicz spaces and corresponding embedding results. To do this in discrete DG spaces requires new ideas, which we describe in this section. As far as we know these bounds are the first embedding estimates for DG spaces using the Orlicz framework.
Below we recall some definitions and basic properties for Orlicz spaces which we require. The reader is referred to [47] for a thorough review of Orlicz spaces. Let be a continuous, convex and even function satisfying
[TABLE]
The Orlicz class consists of all measurable functions such that
[TABLE]
The Orlicz space is the linear span of functions in and it becomes a Banach space when equipped with the Luxemburg norm
[TABLE]
Remark 7.1**.**
Let denote the closure of in . The convexity of implies , see [47]. Moreover, given a sequence and , we say that is mean convergent to if
[TABLE]
Norm convergence in is stronger than mean convergence.
Next, we equip the space with the norn
[TABLE]
where
[TABLE]
for all . Our strategy relies on proving an embedding theorem of the space , for all , into the Orlicz space where
[TABLE]
This embedding is proved in Theorem 7.1 below, which extends Trudinger’s embedding theorem for Orlicz spaces, [53, Theorem 2], to the DG finite element setting.
It will be useful to use the reconstruction operator of Karakashian and Pascal, [35]. The next result is a local version of its approximation properties established in [35].
Lemma 7.1**.**
Let denote the set of edges that contain the node , i.e. . Then for there exists a reconstruction operator such that
[TABLE]
where .
The proof requires an appropriate adaptation of [36, Theorem 2.1], see also [24]. Let , where every consequence pair share the edge , when Using the explicit definition of as an averaging operator, [36], appropriate scaling arguments and the inverse inequality
[TABLE]
the proof relies on establishing
[TABLE]
For details see [30] and previous versions of this manuscript. The next result will be useful.
Lemma 7.2**.**
Let , for all it holds
[TABLE]
where and the reconstruction operator of Lemma 7.1.
Proof.
For all we have
[TABLE]
is a triangulation of the domain , consequently there exists such that . Using inequality (2.2e) we deduce that
[TABLE]
∎
Next we state a crucial lemma, stated in [53, Lemma 1], for a complete proof of the embedding theorem.
Lemma 7.3**.**
Let satisfy the cone condition and . Then for a.e. it holds that
[TABLE]
We may now prove the embedding.
Theorem 7.1**.**
Let satisfy the cone condition. For each , the space is continuously embedded into the Orlicz space where
[TABLE]
Furthermore, for any such that for some , the space is continuously embedded, in the sense of mean convergence, into the Orlicz class ; i.e., whenever then
[TABLE]
Proof.
We exhibit the existence of constants and such that
[TABLE]
To estimate the exponential of , we require to estimate all norms of for . Since
[TABLE]
using Lemma 7.2, we conclude
[TABLE]
where and . As in the proof of [53, Theorem 2] one can show that
[TABLE]
For completeness we highlight some details in the proof of (2.2j) following [53]. Using Lemma 7.3, we conclude
[TABLE]
Regarding the double integral above, applying the Cauchy-Schwarz inequality gives
[TABLE]
We estimate the two double integrals separately. Denoting by the diameter of , we have
[TABLE]
Hence,
[TABLE]
On the other hand, we find that
[TABLE]
and, therefore as before,
[TABLE]
Then, the second term in (2.2l) becomes
[TABLE]
Combining (2.2m)-(2.2n) and (2.2l), we deduce that
[TABLE]
Replacing the above bound in (2.2k) we obtain (2.2j).
Our aim is to bound (2.2i) with respect to . From (2.2d) the following bound holds
[TABLE]
Therefore equation (2.2j) becomes
[TABLE]
Returning to (2.2i) we infer that
[TABLE]
leading to the estimate
[TABLE]
In particular, note that
[TABLE]
so that, choosing such that we reach (2.2h).
Regarding the embedding in the sense of mean convergence, as in [53], we note that bounded functions are dense in the space and hence due to the above embedding. In particular, if , for some , and the embedding is continuous with respect to mean convergence as, by Remark 7.1, norm convergence implies convergence in the mean. ∎
Proposition 7.1**.**
Let a continuous function satisfying
[TABLE]
and suppose that
[TABLE]
for and . Then, up to extracting a subsequence,
[TABLE]
Proof.
Let , , then Up to extracting a subsequence, pointwise a.e. and, by the continuity of , also a.e. in .
Next, note that
[TABLE]
where , is a convex function such that for , where is given in Theorem 7.1. The convexity of implies that
[TABLE]
By Theorem 7.1, we have that converges in , as . Therefore is uniformly integrable. But then (2.2q) implies that is a uniformly integrable sequence and thus in . ∎
Remark 7.2**.**
Proposition 7.1 and the classical embedding of Trudinger for Orlicz spaces [53], also implies that if and , as then
[TABLE]
Finally, we establish the -convergence and the convergence of discrete absolute minimizers when the penalty term has exponential growth.
Theorem 7.2**.**
Let the penalty function have the exponential growth (2.2b). Then, the following properties hold:
- (i)
for all , there exists a sequence with , such that in and
[TABLE] 2. (ii)
for all and all sequences such that in it holds
[TABLE] 3. (iii)
Theorem 6.1 holds, i.e., the discrete absolute minimizers converge to an absolute minimizer of the continuous problem.
Proof.
(i) Following the proof of Theorem 5.2 it remains only to verify in , from (2.2as), where is the sequence defined after (2.2aj). It is enough to show
[TABLE]
in , as . By Proposition 7.1, it suffices to show that {\color[rgb]{0,0,0}\definecolor[named]{pgfstrokecolor}{rgb}{0,0,0}\pgfsys@color@gray@stroke{0}\pgfsys@color@gray@fill{0}|\nabla\bm{u}_{h,\delta_{h}}-\nabla\bm{u}_{\delta_{h}}|_{H^{1}(\Omega,T_{h})}}\rightarrow 0,\text{ as }h\rightarrow 0, i.e.,
[TABLE]
as . Using (2.2am), (2.2aj) (2.2ao) we obtain the following bounds for the first term
[TABLE]
Note that implies from the Sobolev embedding. Then working as (2.2at)
[TABLE]
From (2.2v) and (2.2w) we deduce (2.2u). Also Remark 7.2 implies , in , which concludes the proof of (i).
(ii) This is immediate as is continuous and thus by Fatou’s Lemma,
[TABLE]
(iii) From the convergence result, (i) and (ii) , the proof of Theorem 6.1 can be adopted. ∎
8 Model and Computational Experiments
Numerical Energy Minimization. The potential energy of the continuous model has been discretized using the finite element discretization provided by the FEniCS project [1]. Specifically, we have used quadratic Lagrange elements, i.e., . For the energy minimization procedure we have employed the nonlinear conjugate gradient method, see [44]. A parallelization of the nonlinear conjugate gradient algorithm has been developed using petsc4py data structures [23, 3]. The resulting deformations are visualized with paraview [51].
The nonlinear conjugate gradient method is a popular method for large-scale nonlinear optimization problems. It is a variant of the conventional conjugate gradient method, where for a quadratic function the conjugate directions and the minimum along a given direction can be computed explicitly. For the nonlinear variant, in the th iteration, given the direction , the next search direction (conjugate direction in the conventional method) is computed through the Polar-Ribière method. The minimum value over a given direction is approximated employing line search algorithms that satisfy the strong Wolfe condition, which guarantees in certain circumstances that the computed direction is a descent direction. For details see [44].
Strain Energy Density. Here we describe our model for the strain energy density in (1.1) by following [32, Section 5.2.1]. Starting with a (microscopic) fiber, we let the effective stretch equal the distance between its endpoints divided by its undeformed (relaxed) length. The energy of a single fiber can be expressed as a function of the effective stretch . When the fiber is in tension, it is straight and equals the actual stretch (strain ), while equals the elastic energy due to stretching of the fiber. While in compression, it may be buckled; in which case the elastic (mostly bending) energy of the fiber can still be expressed as a function of the distance between its endpoints. In order to model a 1D fiber energy for a single fiber that buckles in compression, we start with the derivative , which represents force as a function of stretch. We choose a polynomial that has increasing slope so that for (softening in compression due to buckling, and for (stiffening in tension). An example is for with const.. Integrating this with respect to gives an energy
[TABLE]
We model the ECM as a 2D nonlinear elastic continuum undergoing deformations where a particle with position vector in the undeformed state is mapped to deformed position , with the displacement. The strain energy density of the material can be written as a function of the deformation gradient . We model the ECM as an isotropic material, which means that depends on only through the principal stretches , , the eigenvalues of the right stretch tensor . To connect the single fiber energy with the 2D strain energy density we follow e.g., [54]. We suppose the ECM consists of uniformly distributed fibers at the microscopic level. A macroscopically affine deformation is equivalent to a biaxial stretch in two orthogonal directions with stretches , , modulo rotation. A fiber of undeformed length making an angle with the stretch axes in the undeformed state, will have endpoints at and . After deformation the latter is . As a result, the effective stretch of the fiber is , and its energy is . Summing over all fiber orientation angles , we obtain the macroscopic elastic energy density of the fibrous ECM:
[TABLE]
For given e.g. by (2.2a), this integral can be evaluated explicitly:
[TABLE]
Here the deformation invariants are and , the Jacobian determinant of the deformation. The ratio of deformed to undeformed density equals . From [30, Lemma A.1.1], satisfies the lower bound of (2.1). For an upper bound one has to remove the negative terms and use the inequality . We add a fiber volume penalty term to the energy to account for resistance of densified fibers to complete crushing by virtue of their nonzero volume, and to penalize intepenetration of matter. This term increases the energy abruptly when the Jacobian becomes less than a small positive constant , while it becomes negligible as increases from . An example is
[TABLE]
with , where is a large positive constant. The strain energy function is non rank-one convex. In fact the total energy density expressed as a function of the principal stretch pair is a double-well potential, modulo a null Lagrangian [32], which can be chosen so that the two minima of are of zero energy which is positive elsewhere. For a typical choice of parameters, the two minima (wells) of are the reference state and the state . The latter is a severe compression in one direction () combined with a moderate stretch () in an orthogonal direction. This compressed well involves an almost fivefold density increase and corresponds to the densified phase consisting of buckled, collapsed fibers. In our simulations, the deformation in tethers and hairs is in the neighborhood of the compressed, densified well, while outside them it is close to the undeformed well.
Simulations. In the experiments of [32], the rather unpredictable live cells were replaced by round active particles which were embedded in the ECM. These contract on demand by a 50% decrease in radius, thereby exerting tractions onto the surrounding ECM that trigger the phase microstructure formation. In our simulations, the ECM is modelled as a homogeneous material with the strain energy function just described. In the undeformed (reference) configuration, the ECM occupies the part of a rectangular or round domain exterior to one or more circles of radius , which represent active-particle boundaries. Contraction of these particles is modelled by imposing Dirichlet boundary conditions on the displacement . The displacement field is required to vanish on the outside boundary, which is thus assumed fixed. At the inner boundaries , where (circles of radius and center ) is specified as
[TABLE]
This represents a radial contraction which maps each particle boundary to a smaller circle of radius . The constant is obtained from experimental data and has a typical value of 0.5. For a more sophisticated model of active particles that allows shape deviations and motion of centers due to deformation see Remark 3.1 and [32, Section 2.4, Section 5.2.2]. Computations involving a single active particle contracted by at the center of the ECM domain are shown in Figure 8, with a color map of the ratio of deformed over reference density. The densified phase (red) occurs in radial hairlike bands that taper off into the undensified phase (blue). Figures 1c and 1d are examples of fine phase mixtures. The mixture of low and high strain phases is energetically preferable because the average strain it produces is compatible with the Dirichlet boundary conditions, whereas the strains in the densified phase, despite their low energy, are not compatible with the boundary deformation.
In the case of two contracting active particles depicted in Figure 2, the material between the particles is stretched along the axis passing through the active particles’ centers and is compressed in the transverse direction. This renders the strain state of the densified energy well energetically favorable. As depicted in Figure 2, above some critical value of active particle contraction a tract in the densified phase, namely a tether between particles emerges, while radial bands emanate from each particle boundary as in the case of a single particle.
Examples of the agreement between simulations and experiments are shown in Figure 8. In the experiments of [32],a tether is sometimes observed to split into thinner parallel bands (Figure 5a). This is similar to the phenomenon of twinned martensite in crystals, namely splitting and tapering of twin bands in a crystal near an incompatible boundary [34]. Here as well, energy minimization forces strains to stay close to energy-density minima. The active particles in Figure 5a contracted by = 38%. The azimuthal stretch imposed at the particle boundary by contraction is incompatible with the stretch corresponding to the densified-phase energy well. To avoid this mismatch while maintaining displacement continuity, the tethers splits into narrow bands to minimize contact with the particle boundary (experiment:Figure 5a, simulation: Figure 5b).
Can our model predict how close particles should be and how much should they contract in order for a tether to form betwewen them? Particle contraction and distance between particles have been varied in multiple simulations in [32]. This provided a separatrix curve of average particle radial strain versus distance between particles (blue curve in Figure 5c). Above this curve, our model predicts that a tether forms joining the two particles; below the curve no tether will form. Data from our experiments agreed with this prediction: blue points in Figure 5c are data points from experimental particle pairs with a tether observed joining them, red points correspond to pairs without a tether between them. Furthermore, our model predicts that the correct displacement decay rate with distance from a single contracting particle, Figure 5d, which is much slower than in materials that do not suffer phase transition. This is an important feature for long-range mechanosensing. Experiments with fibroblasts [45], reveal the same displacement decay with distance as the one predicted by our computations, of the form . This means that the displacement fields propagate over a longer range compared to the range predicted by linear elasticity, where decay is proportional to . For more details see [30].
If the regularization (higher gradient) term is omitted, i.e. , then the computed solutions depend on the mesh size; similar results can be found in [42]. As depicted in Figures 1a-1d, mesh resolution must be fine enough to capture localized deformations, but further increases of resolution result in more and thinner bands around the active particle. The appearance of phase boundaries is due to the ellipticity failure [37, 48] and the rank-one connected minima. The appearance of finer and finer phase mixtures as resolution is increased is related to incompatibility of the wells with the boundary conditions[34]. As a result, the minimum is not attained, but minimizing sequences develop more and finer oscillations in order to create less incompatible deformations of lower energy [5].This is responsible for the mesh dependence, as increasing mesh resolution simply captures terms further along such minimising sequences as in Figures 1a-1d. The higher gradient term restores the ellipticity of the Euler-Lagrange equation, consequently regularizing the solution, ensuring the existence of a minimizer of limited fineness, and eliminating mesh dependence. In addition, can be considered an internal length scale, controlling the thickness of transition layers that replace gradient discontinuities. This means that smaller values of permit finer microstructures with more and thinner hairs; see an example with varying in Figure 3. Figures 1e-1h illustrate that for fixed numerical solutions converge as mesh size tends to zero, as expected from the analysis in this work, although it is possible that the limit state is merely an isolated local minimum of the energy in this numerical example. The analysis in this work could conceivably apply to the case of convergence to an isolated local minimum as mesh size approaches zero in the presence of fixed in the sense of [13]; see also [6]. When , the energy functional in not lower semicontinuous, but for any the presented theory holds. In the numerical minimization, the local mesh size should be smaller than the length scale imposed by in order to resolve fine structure as is illustrated by Figures 1e-1h. Therefore, for very small values of the degrees of freedom increase substantially due to the necessity of very high resolution, which may raise practical issues with the discrete minimization process.
More complex cases include the contraction of multiple active particles. Then the densified tehters connecting two cells can appear or disappear, influenced by other neighboring cells. An example can be seen in Figure 4.
In [32] extensive simulations of the model are performed which exhibit excellent agreement with experimental results. In particular the elastic phase transition model, combined with the numerical scheme analysed here is capable of predicting and explaining intricate details of the geometry of observed multiphase microstructures in fibrous collagen biomaterials.
Φ≥0, and Φ(∇u ) ≤&
Φ≥0, and Φ(∇u ) ≤&
Figure 5: Comparison with experimental data. (a)-(c) reproduced from [32] with permission of the authors. LABEL:sub@fig:fn3a experiment and LABEL:sub@fig:fn3b simulation of active particle pair contracted by 38%. LABEL:sub@fig:fn3a A tether fully split into multiple thin bands. Insert shows high-contrast version of area within dotted rectangle. LABEL:sub@fig:fn3b Simulation with initial radii, distances and contractions matched with LABEL:sub@fig:fn3a also results in split tether. Colorbar: ratio of deformed to undeformed density. LABEL:sub@fig:fn3c Predicting whether a tether forms between two particles. Blue curve: separatrix obtained from multiple simulations. Axes: % decrease in particle radius vs deformed distance (in deformed particle radii). Above blue curve, tethers are predicted to form between particle pairs. No tether is predicted to form below blue curve. Our experimental data (each particle pair is one point) agreed with the prediction: blue points: tether has formed. Red points: no tether has formed. LABEL:sub@fig:fn3d Displacement norm over radial distance (). Red dots: computed displacement norm at mesh points, blue curve: graph of fitted to the red dots. Least squares fit yielded parameters and .
Acknowledgment
Partially supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement no: 642768 ModCompShock. The research of GG was also supported by a Vannevar Bush Postdoctoral Fellowship.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] M. S. Alnæs, J. Blechta, J. Hake, A. Johansson, B. Kehlet, A. Logg, C. Richardson, J. Ring, M. E. Rognes, and G. N. Wells. The fenics project version 1.5. Archive of Numerical Software , 3(100), 2015.
- 2[2] G. A. Baker. Finite element methods for elliptic equations using nonconforming elements. Math. Comp. , 31(137):45–59, 1977.
- 3[3] S. Balay, S. Abhyankar, M. F. Adams, J. Brown, P. Brune, K. Buschelman, L. Dalcin, A. Dener, V. Eijkhout, W. D. Gropp, D. Kaushik, M. G. Knepley, D. A. May, L. C. Mc Innes, R. T. Mills, T. Munson, K. Rupp, P. Sanan, B. F. Smith, S. Zampini, H. Zhang, and H. Zhang. PET Sc users manual. Technical Report ANL-95/11 - Revision 3.10, Argonne National Laboratory, 2018.
- 4[4] J. Ball and C. Carstensen. Compatibility conditions for microstructures and the austenite–martensite transition. Materials Science and Engineering: A , 273:231–236, 1999.
- 5[5] J. M. Ball and R. D. James. Fine phase mixtures as minimizers of energy. Archive for Rational Mechanics and Analysis , 100(1):13–52, 1987.
- 6[6] S. Bartels, A. Bonito, and R. H. Nochetto. Bilayer plates: Model reduction, Γ Γ \Gamma -convergent finite element approximation, and discrete gradient flow. Communications on Pure and Applied Mathematics , 70(3):547–589, 2017.
- 7[7] S. Bartels, C. Carstensen, K. Hackl, and U. Hoppe. Effective relaxation for microstructure simulations: algorithms and applications. Comput. Methods Appl. Mech. Engrg. , 193(48-51):5143–5175, 2004.
- 8[8] F. Bassi and S. Rebay. A high-order accurate discontinuous finite element method for the numerical solution of the compressible navier–stokes equations. Journal of Computational Physics , 131(2):267–279, 1997.
