A sequential linear programming (SLP) approach for uncertainty analysis-based data-driven computational mechanics

In this article, an efficient sequential linear programming algorithm (SLP) for uncertainty analysis-based data-driven computational mechanics (UA-DDCM) is presented. By assuming that the uncertain constitutive relationship embedded behind the prescribed data set can be characterized through a conve...

Full description

Saved in:
Bibliographic Details
Published inComputational mechanics Vol. 73; no. 4; pp. 943 - 965
Main Authors Huang, Mengcheng, Liu, Chang, Du, Zongliang, Tang, Shan, Guo, Xu
Format Journal Article
LanguageEnglish
Published Berlin/Heidelberg Springer Berlin Heidelberg 01.04.2024
Springer
Springer Nature B.V
Subjects
Online AccessGet full text
ISSN0178-7675
1432-0924
DOI10.1007/s00466-023-02395-8

Cover

More Information
Summary:In this article, an efficient sequential linear programming algorithm (SLP) for uncertainty analysis-based data-driven computational mechanics (UA-DDCM) is presented. By assuming that the uncertain constitutive relationship embedded behind the prescribed data set can be characterized through a convex combination of the local data points, the upper and lower bounds of structural responses pertaining to the given data set, which are more valuable for making decisions in engineering design, can be found by solving a sequential of linear programming problems very efficiently. Numerical examples demonstrate the effectiveness of the proposed approach on sparse data set and its robustness with respect to the existence of noise and outliers in the data set.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0178-7675
1432-0924
DOI:10.1007/s00466-023-02395-8