Pith. sign in

REVIEW

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1911.04855 v1 pith:Q46BRJJU submitted 2019-11-12 math.NA cs.NA

Sequential subspace optimization for recovering stored energy functions in hyperelastic materials from time-dependent data

classification math.NA cs.NA
keywords energyiterationproblemstepstoredbehaviordirectionelastic
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Monitoring structures of elastic materials for defect detection by means of ultrasound waves (Structural Health Monitoring, SHM) demands for an efficient computation of parameters which characterize their mechanical behavior. Hyperelasticity describes a nonlinear elastic behavior where the second Piola-Kirchhoff stress tensor is given as a derivative of a scalar function representing the stored (strain) energy. Since the stored energy encodes all mechanical properties of the underlying material, the inverse problem of computing this energy from measurements of the displacement field is very important regarding SHM. The mathematical model is represented by a high-dimensional parameter identification problem for a nonlinear, hyperbolic system with given initial and boundary values. Iterative methods for solving this problem, such as the Landweber iteration, are very time-consuming. The reason is the fact that such methods demand for several numerical solutions of the hyperbolic system in each iteration step. In this contribution we present an iterative method based on sequential subspace optimization (SESOP) which in general uses more than only one search direction per iteration and explicitly determines the step size. This leads to a significant acceleration compared to the Landweber method, even with only one search direction and an optimized step size. This is demonstrated by means of several numerical tests.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.