Alternating minimization for data-driven computational elasticity from experimental data: kernel method for learning constitutive manifold
Data-driven computing in elasticity attempts to directly use experimental data on material, without constructing an empirical model of the constitutive relation, to predict an equilibrium state of a structure subjected to a specified external load. Provided that a data set comprising stress–strain p...
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | article |
| Lenguaje: | EN |
| Publicado: |
Elsevier
2021
|
| Materias: | |
| Acceso en línea: | https://doaj.org/article/7811f04a4abb47539f5b12f02939f59b |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Sumario: | Data-driven computing in elasticity attempts to directly use experimental data on material, without constructing an empirical model of the constitutive relation, to predict an equilibrium state of a structure subjected to a specified external load. Provided that a data set comprising stress–strain pairs of material is available, a data-driven method using the kernel method and the regularized least-squares was developed to extract a manifold on which the points in the data set approximately lie (Kanno 2021, Jpn. J. Ind. Appl. Math.). From the perspective of physical experiments, stress field cannot be directly measured, while displacement and force fields are measurable. In this study, we extend the previous kernel method to the situation that pairs of displacement and force, instead of pairs of stress and strain, are available as an input data set. A new regularized least-squares problem is formulated in this problem setting, and an alternating minimization algorithm is proposed to solve the problem. |
|---|