SearcharxivSearch

arXiv · 2603.09526

One-Way Thermo-Mechanical Coupled System Identification Using Displacement and Temperature Measurements

Abstract

Structural system identification in the presence of thermal loads is challenging, as unmeasured or poorly modeled thermal effects can mask or mimic damage, leading to unreliable conclusions. This work presents an optimization-driven, adjoint-based high-fidelity system identification framework for localizing structural weakness and recovering the temperature field in one-way thermo-mechanical coupled structures. The methodology builds upon a standard optimization formulation that minimizes weighted discrepancies between simulated responses and measured data from a sparse displacement and temperature sensor network. To account for thermal effects, two strategies are proposed: a monolithic approach, which simultaneously identifies Young's modulus and temperature distributions, and a partitioned approach, which iteratively couples two inexact sub-problems through a Gauss-Seidel type fixed-point scheme. The proposed approaches are evaluated using two numerical examples -- a Plate With a Hole and a Footbridge model -- under linearly varying and localized thermal fields, and for different sensor layouts. Both approaches successfully recover the Young's modulus and temperature distributions, even when sensor placement does not fully capture the underlying thermal trends. Compared with a constant-temperature assumption and interpolation of the temperature field from sensor data, the proposed approach achieves the most accurate damage localization and temperature reconstruction. The largest gains occur when localized thermal features are poorly sampled by sensors, where interpolation and constant-temperature assumptions underperform. Furthermore, results show that the location of the temperature sensors is as influential as the number of sensors: well-placed sensors substantially improve identification, while additional sensors that miss critical thermal features provide limited benefit.

Explore related subjects

Keep this discovery

BibTeXRIS

Talhah Shamshad Ali Ansari, Suneth Warnakulasuriya, Ihar Antonau, Harbir Antil, Rainald Löhner, Roland Wüchner. 2026-03-10. One-Way Thermo-Mechanical Coupled System Identification Using Displacement and Temperature Measurements. https://arxiv.org/abs/2603.09526

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms

Minimum-distance bipartite matching on general networks has numerous applications various fields. This paper first focuses on deterministic problems and presents an exact edgewise-separable convex-flow reformulation. By introducing a smooth monotone rearrangement approximation of the edge-wise imbalance profiles, the convex-flow reformulation's can be solved efficiently. If we further conduct a first-order resistance-based approximation of the convex program, a one-step Laplacian-based estimator can be analytically derived in closed forms. The paper also studies random problems where supply and demand points are randomly distributed. We show that the expected optimal matching distance scales with the square root of the number of points if the supply/demand point distributions are identical, or linearly otherwise. In the former case, the optimal flow is proven to be centered, symmetric, and sub-Gaussian. In the latter case, the limiting resistance network characterizes how supply-demand imbalance is redistributed and motivates a fast algorithm that approximate the optimal flow based on the limiting resistance. Numerical experiments show that the proposed estimators closely approximate the exact matching cost while substantially reducing computation time. The proven theoretical properties of the random matching solution are numerically verified by large-scale Monte Carlo simulations.

math.OC

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error. This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation, so uncertainty persists even if the mixture law is known. We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law. Under exchangeability, the set covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism. The conformal path induces a data-driven transport geometry, while $\alpha$ determines the radius. The worst-case problem reduces to a finite linear program over conformal shells and admits sparse adversarial solutions. The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.

math.OC

The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case

In this paper we extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is the consideration of more than two sets. The other is the ability to handle each set as an intersections of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to this generalizations is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. This enable us to overcome a certain theoretical obstacle related to cycles and minimizers of general functionals. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fej\'er monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.

math.OC