Identifying the stored energy of a hyperelastic structure by using an attenuated Landweber method
Julia Seydel, Thomas Schuster

TL;DR
This paper develops a numerical method using the attenuated Landweber approach to identify the stored energy function of hyperelastic materials from displacement data, aiding structural health monitoring and damage detection.
Contribution
It introduces a novel application of the attenuated Landweber method for inverse hyperelasticity problems, including convergence analysis and practical damage localization.
Findings
The parameter-to-solution map satisfies the local tangential cone condition.
The method effectively localizes damages in hyperelastic structures.
Numerical experiments validate the approach's suitability for damage detection.
Abstract
We consider the nonlinear, inverse problem of identifying the stored energy function of a hyperelastic material from full knowledge of the displacement field as well as from surface sensor measurements. The displacement field is represented as a solution of Cauchy's equation of motion, which is a nonlinear, elastic wave equation. Hyperelasticity means that the first Piola-Kirchhoff stress tensor is given as the gradient of the stored energy function. We assume that a dictionary of suitable functions is available and the aim is to recover the stored energy with respect to this dictionary. The considered inverse problem is of vital interest for the development of structural health monitoring systems which are constructed to detect defects in elastic materials from boundary measurements of the displacement field, since the stored energy encodes the mechanical peroperties of the underlying…
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.
Identifying the stored energy of a hyperelastic structure by using an attenuated Landweber method
Julia Seydel Department of Mathematics, Saarland University, PO Box 15 11 50, 66041 Saarbrücken, Germany ([email protected]).
Thomas Schuster Department of Mathematics, Saarland University, PO Box 15 11 50, 66041 Saarbrücken, Germany ([email protected]), correspondent author.
Abstract
We consider the nonlinear, inverse problem of identifying the stored energy function of a hyperelastic material from full knowledge of the displacement field as well as from surface sensor measurements. The displacement field is represented as a solution of Cauchy’s equation of motion, which is a nonlinear, elastic wave equation. Hyperelasticity means that the first Piola-Kirchhoff stress tensor is given as the gradient of the stored energy function. We assume that a dictionary of suitable functions is available and the aim is to recover the stored energy with respect to this dictionary. The considered inverse problem is of vital interest for the development of structural health monitoring systems which are constructed to detect defects in elastic materials from boundary measurements of the displacement field, since the stored energy encodes the mechanical peroperties of the underlying structure. In this article we develope a numerical solver for both settings using the attenuated Landweber method. We show that the parameter-to-solution map satisfies the local tangential cone condition. This result can be used to prove local convergence of the attenuated Landweber method in case that the full displacement field is measured. In our numerical experiments we demonstrate how to construct an appropriate dictionary and show that our algorithm is well suited to localize damages in various situations.
keywords:
stored energy function, Cauchy’s equation of motion, hyperelasticity, conic combination, attenuated Landweber method, local tangential cone condition
AMS:
35L70, 65M32, 74B20
1 Introduction
The starting point of our inverse problem is Cauchy’s equation of motion for an hyperelastic material
[TABLE]
where denotes time and a point in a bounded, open domain in . Furthermore, denotes the mass density in and is an external body force. The function , with , is called stored energy function and encodes the mechanical properties of the material. The derivative is to be understood componentwise and represents the displacement gradient in and . We refer to standard textbooks like [11, 17, 23] for detailed introductions and derivations of Cauchy’s equation.
Given initial values and and assuming that we have homogeneous Dirichlet boundary values we end up with
[TABLE]
for and with
[TABLE]
and
[TABLE]
Equation (1) describes the behavior of hyperelastic materials. An example for hyperelastic materials are carbon fibre reinforced composites (CFC). This is why the inverse problem of identifying from measurements of the displacement field can be very important for the detection of defects in such structures, the so called structural health monitoring, see [15]. Structural health monitoring systems consist of a number of actors and sensors which are applied to the structure’s surface. The idea is that the actors generate guided waves propagating through the structure which interact with defects and are subsequently acquired by the sensors. Mathematically this can be described as an inverse problem of determining material properties from boundary data of the displacement field which is a solution of (1). In this article we investigate the reconstruction problem of the stored energy function where we consider two different scenarios for the data acquisition. On the one hand we assume to have as data the full displacement field available and on the other hand we suppose that the data are measured on parts of the boundary. The second scenario is used as mathematical model for sensor measurements.
Because there are numerous publications on inverse identification problems in elastic media for different settings, we only summarize here articles which are associated with the scope of this article. A comprehensive overview of various inverse problems in the field of elasticity offers the article [8]. In [9] Bourgeois and others have applied and implemented the linear sampling method, introduced by Colton and Kirsch in [12] for detection of reverberant scatterers, for the isotropic Navier Lamé equation. Because the method represents a possibility to detect defects in isotropic materials and damages, which are described by such a scatterer, it was used in [10] for the identification of cracks. The inverse problem on determining the spatial component of the source term in a hyperbolic equation with time-dependent principal part is investigated in [18]. For solving this problem numerically the authors adopt the classical Tikhonov regularization to transform the inverse problem into an output least-squares minimation that can be solved by the iterative thresholding algorithm. In [2] the authors developed an algorithm for the quantitative reconstruction of constitutive parameters, namely the two eigenvalues of the elasticity tensor, in isotropic linear elasticity from noisy full-field measurements. An algorithm, that guarantees the conservation of the total energy as well as the conservation of momentum and angular momentum is found in [29]. The reconstruction of an anisotropic elasticity tensor from a finite number of displacement fields for the linear, stationary elasticity equation is represented in [3]. Lechleiter and Schlasche considered in [22] the identification of the Lamé parameters of the second order elastic wave equation from time-dependent elastic wave measurements at the boundary. For this reason they dispose an inexact Newton iteration validating the Fréchet differentiability of the parameter-to-solution map in terms of [21]. A semi-smooth Newton iteration for the same problem was implemented in [7] also delivering an expression for the Fréchet derivative. The topic of our considerations is the identification of spatially variable stored energy functions from time-dependent boundary data which has not been investigated so far, to the best of our knowledge. In [6] an algorithm for defect localization in fibre-reinforced composites from surface sensor measurements was proposed using the equations of linear elastodynamics as mathematical model. The key idea of the method is the interpretation of defects as if they were induced by an external volume force. In some sense this article can be seen as the foundation of the method presented here.
We want to specify the inverse problems to be investigated in this article. Inspired by Kaltenbacher and Lorenzi [19] and following the authors of [27, 31] we assume to have a dictionary consisting of appropriate functions , , given such that
[TABLE]
with nonnegative constants , . In that way the mentioned dictionary should consist of physically meaningful elements such as polyconvex functions, see [4, 17]. The wave equation then is then given as
[TABLE]
for and . We consider at first the following inverse problem.
(IP I) Given as well as the displacement field for and , compute the coefficients , such that satisfies the initial boundary value problem (IBVP) (6), (2)–(4).
Denoting by the forward operator, which maps a vector to the unique solution of the IBVP (6), (2)–(4) for fixed, then (IP I) is represented by the nonlinear operator equation
[TABLE]
Here, denotes the domain of to be specified in Section 3. In that case we assume to have the full knowledge of the displacemt field. We solve this problem numerically. Since in practical applications measurements usually are only acquired at the structure’s surface we consider a further inverse problem,
[TABLE]
where is the observation operator, which maps the solution of (6) to measured data. Thus the observation operator includes the measurement modalities to our mathematical model. Following the article [6] we want to model having sensors in mind that average the displacement field on small parts of the boundary of the structure . For this reason we define by
[TABLE]
where is the number of sensors and , , are weight functions that display the localization of the particular sensors. We assume that the functions for all have small support on . For more information about this definition of the observation operator see [6]. The second inverse problem is defined as follows.
(IP II) Given as well as data , compute the coefficients , such that satisfies (8).
Outline. Section 2 provides all mathematical ingredients and tools which are necessary to deduce the results of the article. In particular we summarize an existing uniqueness result for the solution of the IBVP (6), (2)–(4) (Theorem 1) and results of the article [28]. Section 3 describes the implementation of a numerical solver the inverse problems (IP I), (IP II) using the attenuated Landweber method. In Section 4 we prove the local tangential cone condition for (IP I) and relying on that a convergence result for the attenuated Landweber iteration when applied to (IP I). Numerical results for (IP I) and (IP II) are subject of Section 5. Section 6 concludes the article.
2 Setting the stage
For the investigations and proofs in this article we need at first some results the most of which are proven in [31] and [28]. The first one is a uniqueness result for the IBVP (6), (2)–(4) from [31].
In the following we assume that the conditions and are valid for the function for all and . Furthermore we restrict the nonlinearity of all functions and hence of by supposing, that there exist positive constants for , such that
[TABLE]
and
[TABLE]
hold for all and for almost everywhere. Let be the Frobenius norm induced by the inner product of matrices
[TABLE]
In addition we require the existence and boundedness of higher derivatives of with respect to . More precisely we assume, that there are constants for with
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
for and . Additionally we require
[TABLE]
for all , which holds true if e.g. . We suppose that the mapping is three times continuously differentiable for almost everywhere.
Furthermore, the set of admissible coefficient vectors of the conic combination (5) is supposed to be restricted by assuming
[TABLE]
It is easy to see that this set is coupled to the nonlinearity conditions of (9)–(16) via the constants for .
After all we define the following set of admissible solutions of IBVP (1)–(4). Let be given the constants , . Then we set
[TABLE]
Let us notice that this set is only a subset of the set of admissible solutions mentioned in [31] and [28] because of the additional condition for all . holds true, if e.g. , , , and are sufficiently smooth.
Now all necessary conditions are mentioned to prove the following uniqueness result for the solution of the IBVP (6), (2)–(4) for given , which has been presented in [31].
Theorem 1** ([31, Theorem 2.1]).**
Let , be two solutions to the initial boundary value problem (6), (2)–(4) corresponding to the parameters, initial values and right-hand sides and , respectively. Furthermore, assume that . If, in addition, the condition
[TABLE]
is satisfied for
[TABLE]
and if there are constants and , so that
[TABLE]
then there exist constants , and , such that the stability estimate
[TABLE]
is valid for all . Thereby, the constants , and only depend on , , , , ,
[TABLE]
and
[TABLE]
where is a constant, whose existence is ensured by inequality (19). The constant is defined by the continuity of the embedding ,
[TABLE]
*for all . Moreover, the constants , and are uniformly bounded, if we take with bounded.
The function is positive and bounded in the following way because of the non-negativity of the coefficients :
[TABLE]
Next we prove an estimate being necessary for the proof of Theorem 15 and following from Theorem 1.
Corollary 2**.**
Let be two solutions of the problem (1) - (4). Then there is for and all
[TABLE]
Proof.
Using the condition it follows by the triangle inequality
[TABLE]
for all . Hence we have and therefore
[TABLE]
for all and . Finally we obtain the estimate
[TABLE]
and hence the assertion of the corollary. ∎
Next we define for the remainder of the article the following spaces
[TABLE]
and identify with its dual space . Then we obtain the Gelfand triple
[TABLE]
with dense, continuous embeddings. Furthermore let be
[TABLE]
with
[TABLE]
for all and thereby
[TABLE]
with dense, continuous embeddings and . Then the Poincaré inequality yields that there is a constant with
[TABLE]
for all . Besides it follows directly from the definition of the norms in and
[TABLE]
for all .
For the proof of the local tangential cone condition we need Gronwall’s lemma.
Lemma 3** (Gronwall’s lemma).**
Let and be non-negative functions. If satisfies
[TABLE]
for all with constants and , then
[TABLE]
*is valid for all .
A proof of this version is given in [1]. The following results in connection with the Gâteaux/Fréchet derivative of the forward operator and its adjoint operator are proven in [28]. That is the reason why there are no proofs in the remainder of this section. For this purpose let be the domain of the forward operator defined by
[TABLE]
At first we characterize the Gâteaux derivative of .
Lemma 4**.**
Let \alpha\in\mathrm{int}\big{(}\mathrm{D}(\mathcal{T})\big{)} be an interior point of . The Gâteaux derivative of the solution operator fulfills for the following linear system of differential equations with homogeneous initial and boundary value conditions
[TABLE]
for and ,
[TABLE]
and
[TABLE]
Here, we used the notations
[TABLE]
It was proven in [28] that the IBVP (30)–(32) has a unique solution and hence the Gâteaux derivative is well defined.
Theorem 5**.**
*The IBVP (30)–(32) has a unique, weak solution in .
The aim of [28] was to show, that even is Fréchet differentiable. To this end it was proven that the mapping , , is linear and bounded. It is linear because (30) is linear in and . The continuity was subject of the following theorem.
Theorem 6** ([28, Prop. 3.4]).**
*Adopt the assumption of Lemma 4. The Gâteaux derivative is continuous in for all , i.e. there is a constant with .
Next we state the Fréchet differentiability of .
Theorem 7** ([28, Th. 3.8]).**
Adopt the assumptions of Lemma 4 and let . There is a constant depending only on , and such that
[TABLE]
We continue by recapitulating the representation of the adjoint operator of the Fréchet derivative , which was also proven in [28]. We will see that the adjoint is important when applying iterative solvers as the Landweber method to the inverse problem . Let be the space consisting of all solutions of
[TABLE]
for , if we define the mapping by
[TABLE]
for all . Then we have and the mapping is bijective since (34) with (31) and (32) is uniquely solvable according to Theorem 5. This yields , , where solves (34) with (31) and (32). Finally endowed with the norm turns into a Hilbert space, which is a closed subspace of . The following lemma states that the embedding even is continuous.
Lemma 8**.**
The embedding is continuous, i.e. there is a constant not depending on such that
[TABLE]
A representation of the adjoint operator for fixed is presented in the following theorem.
Theorem 9**.**
Let be fixed and . The adjoint operator of the Fréchet derivative is given by
[TABLE]
where is the weak solution of the hyperbolic, backward IBVP
[TABLE]
We have now all ingredients together for the proof of the convergence result in Section 4 and the numerical solution of (IP I). The last point to consider in this section is the observation operator, which is needed for (IP II). Let be the observation operator with
[TABLE]
where is the trace operator and given weight functions (see Section 1). Then represents the data space. Because of (40) it is easy to see that is linear in . Furthermore it is proven in [6] that is continuous in and that the adjoint operator has for all the representation
[TABLE]
3 Numerical scheme
In this section we outline a numerical solution scheme for computing a solution of (7) with input data . We want to use the attenuated Landweber method (see for example [13], [25] or [20]). This iteration is defined for solving (IP I) via
[TABLE]
and for solving (IP II) via
[TABLE]
with initial value and relaxation parameter
[TABLE]
with
[TABLE]
We always denote by the closed ball centered about with radius . In (42) respectively (43) we can see that we have to solve in every iteration step of the attenuated Landweber method respectively once the forward problem (6), (2)–(4) and the adjoint problem (37), (38)–(39). So we need at first an algorithm for solving the forward problem. Because of the second time derivative in the differential equation we split initially the differential equation and then we get with for all the equivalent formulation
[TABLE]
for all . We discretized this equation system at first in time with the -method with . Let be equidistantly partitioned in equal time steps of length and points , . Then we get with for all in every time step for all the following formulation of the time discretized equations
[TABLE]
After some reformulations we get the system
[TABLE]
It is easy to see that the first equation is not linear in and the second one is linear in . That is the reason why we have to implement a nonlinear solver for the first equation. Then we can discretize in space and solve both equations. For using the Newton method to solve the first equation we define
[TABLE]
with the iteration index of the Newton method. Then the first equation in (47) is equal to the nonlinear equation . The Newton method yields a solution of this equation determining with
[TABLE]
with
[TABLE]
and after that setting
[TABLE]
for all with until a sufficient accuracy is achieved. Before we discretize the reformulated time discretized equations we want to present the following weak formulation of the splitted representation of the problem including the nonlinear solver in every time step . Therefore we choose as solution and test space. Then we get:
Find such that
[TABLE]
for all and set
[TABLE]
*for all .
Find such that*
[TABLE]
*for all .
For the discretization in space of the weak formulation of the time discretized problem we use the Finite Element method. In particular for the implementation we used the C++ finite element library deal.II, see [5]. Let be a finite dimensional conform finite element space with nodal basis with . Then we can expand all functions in the weak formulation given above in terms of the nodal basis. Hence we want to denote by a capital letter the vector of the coefficients of a function. That means for example mit . Then we get after some reformulations the following matrix equations at each time step,
[TABLE]
with the mass matrix
[TABLE]
[TABLE]
and
[TABLE]
In addition we used the matrix with the entries
[TABLE]
for all and the vector with
[TABLE]
for all .
Finally we get the following algorithm for solving the forward problem using the Conjugate Gradient (CG) method for solving the first equation in (54).
Algorithm 10**.**
*()
Input: *
Set . 2. 2.
Set . 3. 3.
For every do
- 3.1
Set . 2. 3.2
Set . 3. 3.3
Compute . 4. 3.4
Compute . 5. 3.5
Compute with . 6. 3.6
Set . 7. 3.7
While () do
- i.
Set . 2. ii.
*Compute ***
[TABLE] 3. iii.
Compute . 4. iv.
Compute with . 5. v.
Set . 8. 3.8
Set .
Output: for .
We proceed in the same way to develop an algorithm to solve the adjoint problem. The advantage is that this problem is linear. At first we split the corresponding differential equation with for all , too. Then we get the equivalent system
[TABLE]
for all . After time discretization by the -method separating in equal time steps with fix length and time points , , we have in time step for all
[TABLE]
and with some reformulations
[TABLE]
Because both equations of this system are linear we can directly discretize the equations in space and after that solve the system. For this purpose we use the same notations as before. Additionally let be . Then we get the dual basis to , where is for all . We obtain for the adjoint problem the system
[TABLE]
In the end with some reformulations and using the definitions
[TABLE]
and
[TABLE]
we can reformulate (56) as
[TABLE]
Using again the CG method for solving the first equation of (56) we preserve the following algorithm for solving the adjoint problem:
Algorithm 11**.**
*()
Input: and for *
Set . 2. 2.
Set . 3. 3.
For every do
- 3.1
Compute . 2. 3.2
Compute . 3. 3.3
Compute . 4. 3.4
Compute with
[TABLE] 5. 3.5
Compute with
[TABLE]
Output: for .
Finally we discretize the observation operator in the same way as in [6]. Let be . Then we can write with the basis of . It follows
[TABLE]
with the matrix, which represents in the bases of and of . In addition we can identify respectively with its dual space, if we choose the standard scalar product in . Then the matrix is exactly the representation of in the bases of and of .
If we choose the weight functions , , also from , which means for all , then we obtain by (60)
[TABLE]
where with for all is the boundary mass matrix and the coefficient matrix of the sensors with for all and . Then we get
[TABLE]
With that discretization of the observation operator we are able to present the algorithm for the adjoint problem in the case (IP II) of incomplete data. We get
Algorithm 12**.**
*()
Inpute: and for *
Set . 2. 2.
Set . 3. 3.
For every do
- 3.1
Compute . 2. 3.2
Compute . 3. 3.3
Compute . 4. 3.4
Compute with
[TABLE] 5. 3.5
Compute with
[TABLE]
Output: for .
We have all ingredients to formulate the algorithm for solving the inverse problem (IP II).
Algorithm 13**.**
*()
Input: for , basis functions with .*
Compute the matrices , and with
[TABLE]
[TABLE]
and
[TABLE] 2. 2.
Set . 3. 3.
Set . 4. 4.
Set 5. 5.
While () and () do
- 5.1
Set . 2. 5.2
Compute . 3. 5.3
Compute . 4. 5.4
Set . 5. 5.5
Set \delta=\frac{T}{m}\Big{[}\frac{1}{2}\|w^{0}\|_{\mathbb{R}^{l}}^{2}+\sum\limits_{j=1}^{m-1}\|w^{j}\|_{\mathbb{R}^{l}}^{2}+\frac{1}{2}\|w^{m}\|_{\mathbb{R}^{l}}^{2}\Big{]}. 6. 5.6
Compute . 7. 5.7
For all :
- 5.7.1
Compute . 2. 5.7.2
Set \gamma=\frac{T}{m}\Big{[}\frac{1}{2}z^{0}+\sum\limits_{j=1}^{m-1}z^{j}+\frac{1}{2}z^{m}\Big{]}. 3. 5.7.3
Compute .
Output: .
Because the modifications of the algorithm for solving (IP I) are dispensable we omit to write the algorithm separately.
4 Convergence result
In this section we prove local convergence of the attenuated Landweber iteration (42) applied to (7). Therefore let be two solutions to the initial boundary value problem (6), (2)–(4) corresponding to the parameters, initial values and right-hand sides respectively . First we prove the local tangential cone condition for the parameter-to-solution map associated to the considered identification problem, because it is necessary for our proof of convergence of the attenuated Landweber method. For the proof of the cone condition we need a technical result.
Lemma 14**.**
For with under the assumption for a sufficiently small there is
[TABLE]
Thereby we define
[TABLE]
*for all .
Proof.
Let be and .
With the definition of the norm of we get at first
[TABLE]
We estimate the two summands on the right hand side separately.
For the first one we obtain with (the proof of) Theorem 33 (see [28])
[TABLE]
with
[TABLE]
where holds true.
For the second summand we consider
[TABLE]
Using (27) and again Theorem 33 yields
[TABLE]
In addition the proof of Theorem 7 in [28] delivers for with
[TABLE]
[TABLE]
and
[TABLE]
the estimate
[TABLE]
In the same way as in the proof of Theorem 7 (see [28]) we get
[TABLE]
Hence we obtain for the second summand
[TABLE]
and finally the assertion of the lemma. ∎
Now we can state the local tangential cone condition for our identification problem.
Theorem 15**.**
For with and a constant there is
[TABLE]
Remark 16**.**
*We note that the inequality (62) is strictly speaking only a tangential cone condition if the constant is bounded as (see [16]). We prove this under certain constraints on in the proof of Theorem 18.
Before we can show Theorem 15, we have to prove the subsequent lemma.
Lemma 17**.**
Let be . Then for the weak solution of
[TABLE]
it is
[TABLE]
Proof.
(Proof of Lemma 17) Multiplying equation (63) by and integrating over yield
[TABLE]
for . Then we get
[TABLE]
for with
[TABLE]
for all and therefore (see [28])
[TABLE]
With Gronwall’s lemma for , ,
, and we get for :
[TABLE]
This yields together with the Hölder equation
[TABLE]
Using (27) and Theorem 7 it follows
[TABLE]
Then we have
[TABLE]
for . Using the fact, that
[TABLE]
is monotonically increasing for , and the mean value theorem, we derive
[TABLE]
and so the assertion of the lemma. ∎
Now we want to show Theorem 15.
Proof.
Let be and the solutions of the differential equations
[TABLE]
respectively
[TABLE]
In addition there is after Section 2 and accordingly (30) for
[TABLE]
Using the definition and linearity of it follows for
[TABLE]
This yields with for and for
[TABLE]
Then we have
[TABLE]
With Lemma 14 it is . Now let be given an arbitrary . Then we obtain with from (67)
[TABLE]
and with partial integration, the triangle inequality and for all
[TABLE]
Using (11), (10), the Hölder inequality and Corollary 2 we can further estimate
[TABLE]
Then we have with
[TABLE]
the inequality
[TABLE]
for all .
Now let be . In Lemma 17 we have proven that . Then it is
[TABLE]
and therefore
[TABLE]
Furthermore we have with (26) and following the same lines as in the proof of Lemma 8 (see [28])
[TABLE]
and thus
[TABLE]
Finally we obtain from (69), (70) and (71)
[TABLE]
und thereby
[TABLE]
because follows directly from Lemma 14, and Lemma 8. Setting this finally gives the assertion. ∎
We prove now the main result of this section.
Theorem 18**.**
Let be solvable in a ball centered about the initial value with
[TABLE]
and radius
[TABLE]
Then the attenuated Landweber iteration converges under the assumption
[TABLE]
*with from Theorem 6 applied to input data to a solution of . If for all , then converges to the minimum-norm-solution as .
Proof.
At first the operator is Fréchet-differentiable because of Theorem 7. Furthermore there is for a due to Theorem 6 and hence the Fréchet-derivative is bounded. Thereby is continuously Fréchet-differentiable. In addition we deduce again from Theorem 6 that holds true for a constant and for all and hence also for all . For this reason we get with (74) the estimation for all .
According to Theorem 15 we estimate
[TABLE]
for and . Using (73) we obtain
[TABLE]
Hence, . For this reason all assumptions of Theorem 11.4 of [14] and Theorem 2.4 of [20] are satisfied. ∎
Using the last theorem we want to show the following convergence result for noisy data
with for one .
Corollary 19**.**
Given the assumptions of Theorem 18 and that the Landweber iteration applied to is stopped with according to the discrepancy principle
[TABLE]
for all with a positive tolerance parameter satisfying
[TABLE]
*then converges to a solution of as .
Proof.
In the proof of Theorem 18 we showed that all assumptions of Theorem 11.4 of [14] and hence of Theorem 11.5 of [14] are fullfilled. This yields the assertion. ∎
5 Numerical results
To verify the ability of the method to localize damages we performed some test computations. We assume that all entries of the coefficient matrix of the undamaged plate are equal to . We simulate a wave propagating through a plate including a damage which is modeled by entries of the coefficient matrix different from . In this way we generate the displacement field . The input to our algorithm was then the output of the observation operator applied to
[TABLE]
We consider a plate of Neo-Hookean material with measures . The plate is discretized by trilinear elements. Furthermore the simulation time interval is with subdivided equidistantly by 16 time points. For the numerical consideration we assume that we have a plate with the measures with 4 cells in -direction and 30 cells in - and -direction, such that there is an equidistant decomposition , of . In addition we use in the algorithm a time intervall again subdivided equidistantly by 16 time points. As a next step we want to specify the material model. We use for the stored energy function a conic combination
[TABLE]
for all , of tensor products
[TABLE]
for all . As noted before we consider a Neo-Hookean material, such that we have
[TABLE]
with and for as well as and . Therefore we set and as in the article [24]. For this function we compute
[TABLE]
and
[TABLE]
with an arbitrary tensor of second order. For the functions , , we will appropriate B-Splines. Due to the assumption that if there is a defect, then it occurs at the boundary of the plate as for example in the case of delaminations, we consider in -direction two layers and near the boundary of the plate. For the numerical treatments we choose at and at . Corresponding to the assumption above we have only undamaged material and set for all between the two layers. At the two layers it is either or and so there the stored energy function depends only on and relating to the space. Then we choose for the stored energy function
[TABLE]
with for all and and are B-Splines of first order. Finally, it can be proven that if we consider the B-Splines at the nodes , , , of the equidistant decomposition of , then we have
[TABLE]
for all . That yields to
[TABLE]
and the corresponding derivatives for all at the two layers.
In every simulation the wave is excited at the beginning of the simulation time at one point, at the center of the plate. The excitation signal was chosen as
[TABLE]
with , and defined as in figure 1.
Thus the excitation signal acts in -direction. We have taken this approach for the excitation signal from [6]. The only difference is that their the wave is excited at four different locations. The damaged areas are of cylindrical shape with the axis in thickness direction and a square as base with side length equal to one. There were three scenarios
- •
One damaged area approximately in the center of the plate at (Scenario A)
- •
Two damaged areas, one of them nearer to to center of the plate at , the other nearer to one edge of the plate at (Scenario B)
- •
Two damaged areas, both relatively close to the center of the plate at and (Scenario C)
We also stated the center of the square representing the respective damage area. The three damage scenarios are plotted in figure 2.
Let be the Lagrangian basis of the Galerkin space of the chosen Finite Element discretization. Then every basis function is at exactly one node equal to and at all other ones [math]. According to [6] we choose a basis element confined to the boundary of the plate as weighting function for every sensor of the observation operator. It follows that the observation matrix has the structure of a diagonal matrix multiplied with the boundary matrix , where with if is the Lagrangian basis. In this way for the description of the observation operator it is sufficient to indicate the nodes, which are associated with a basis element that is at the same time a weighting function.
The relaxation parameter was in all examples set to . The value of the displacement is estimated experimentally by solving the problem for a given coefficient matrix . To interpret the results we plot the coefficient matrix, where several colors represent different values of the single entries of the coefficient matrix.
For our experiments we assumed initially to have complete data. In a first experiment we have computed 50 Iterations of the attenuated Landweber method for all three damage scenarios. The results are presented in figure 3.
We see that our method can detect and localize the given damages. Regarding the damage scenarios B and C and therefore in case of two damaged areas it can be seen that there are artifacts between the center of the plate and the damaged area nearer to the center. One might suspect that the artifacts arise due to reflecions from the first damaged area meeting by the wave. To emphasize that we consider two damage scenarios with two damage areas.
In a second experiment we want to see how the results of the algorithm change in case of noisy data. For that purpose we add a random vector to the input data to get the noisy data with
[TABLE]
Here we use the representations and at the time points for all (see Section 3). For our calculations we use different values up to 1 for . In figure 4 one can see the difference between and for at time .
The result of experiment 2 is given in Figure 5 and proves the stability of the algorithm with respect to noise.
In a third experiment we consider in contrast to the first two ones incomplete data. Therefore we use as input data the displacement field with the observation operator . In the experiment we computed the solution with two observation operators where the sensors are attached in parallel to the four edges of the plate on both sides of the plate. For the observation operator R57d there are sensors at every edge and so all in all at the whole plate and for the other one called R8d we have sensors at every edge and so sensors at th whole plate. The advantage of the usage of two different observation operators, where the sensors are attached in the same way, is that we can see, how the number of sensors influences the result of the experiment. In figure 6 we can see the result after iterations. It is obviously that indeed the damage is localized in both cases, but a higher number of sensors yields a better result. Using the observation operator R8d we have more artifacts and a smaller domain such that the localized damage is less visible compared to R57d.
6 Conclusion
In this article we proposed a method to detect defects in hyperelastic materials from full knowledge of the displacement field as well as sensor measurements acquired at the surface of the structure by solving a nonlinear inverse problem. The key idea is that we can represent the stored energy function of the hyperelastic material as a conic combination of suitable functions. Identifying these coefficients leads to the localization of defects in the structure. The arising inverse problem is highly nonlinear and ill-posed. In this article we solve the problem using the attenuated Landweber method. Therefore each iteration involves the solution of the nonlinear direct problem and the linear adjoint problem. The developed solver for the direct problem is also used to produce synthetic data. Numerical experiments showed a good performance in both cases of input data. We demonstrated that the method is also stable using noisy data. In addition it was proven that the considered identification problem fulfills the local tangential cone condition and hence that the attenuated Landweber method converges in the case of full knowledge of the displacement field to a solution of the inverse problem.
The given results show that the developed method present great space for future research. A next step in view of developing an autonomous, sensor based structural health monitoring system could be the verification of the method with real measurements at piezo sensors. Further research has to be done with respect to improve the efficiency of the method, since the Landweber method converges slowly. At the same time a finer discretization in time and space would be desirable but is out of reach because of the tremendous computing time. In that sense model reduction methods or sequential subspace optimization techniques (cf. [26, 30]) could be suitable remedies in near future. Furthermore it might be interesting to extend the numerical considerations to curved structures such as shells as they are applied in aircraft construction.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] D. D. Bainov and P. S. Simeonov , Integral Inequalities and Applications, Mathematics and its Applications , vol. 57 of East European series, Kluwer Academic Publishers, Dordrecht, 1992.
- 2[2] G. Bal, C. Bellis, S. Imperiale, and F. Monard , Reconstruction of constitutive parameters in isotropic linear elasticity from noisy full-field measurements , Inverse Problems, 30 (2014), p. 125004.
- 3[3] G. Bal, F. Monard, and G. Uhlmann , Reconstruction of a fully anisotropic elasticity tensor from knowledge of displacement fields , SIAM J. Appl. Math., 75 (2015), pp. 2214––2231.
- 4[4] J. M. Ball , Convexity conditions and existence theorems in nonlinear elasticity , Archive for Rational Mechanics and Analysis, 63 (1977), pp. 337–403.
- 5[5] W. Bangerth, R. Hartmann, and G. Kanschat , deal.II – A General Purpose Object Oriented Finite Element Library , ACM Trans. Math. Softw., 33 (2007), pp. 24/1–24/27.
- 6[6] F. Binder, F. Schöpfer, and T. Schuster , Defect localization in fibre-reinforced composites by computing external volume forces from surface sensor measurements , Inverse Problems, 31 (2015). ID 025006, 22pp.
- 7[7] C. Boehm and M. Ulbrich , A semismooth newton-cg method for constrained parameter identification in seismic tomography , SIAM Journal on Scientific Computing, 37 (2015), pp. S 334–S 364.
- 8[8] M. Bonnet and A. Constantinescu , Inverse problems in elasticity , Inverse Problems, 21 (2005), pp. R 1–R 50.
