Efficient computing technique for reliability analysis of high-dimensional and low-failure probability problems using active learning method

In spite of recent advancements in reliability analysis, high-dimensional and low-failure probability problems remain challenging because many samples and function calls are required for an accurate result. Function calls lead to a sharp increase in computational cost in terms of time. For this reas...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Probabilistic engineering mechanics Ročník 77; s. 103662
Hlavní autoři:	Rajak, Pijus, Roy, Pronab
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier Ltd 01.07.2024
Témata:	Active learning algorithm Kriging metamodel Sample selection strategy Space-filling design Stopping criterion Unsupervised clustering algorithm Active learning algorithm Stopping criterion Unsupervised clustering algorithm Space-filling design Sample selection strategy Kriging metamodel
ISSN:	0266-8920
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	In spite of recent advancements in reliability analysis, high-dimensional and low-failure probability problems remain challenging because many samples and function calls are required for an accurate result. Function calls lead to a sharp increase in computational cost in terms of time. For this reason, an active learning algorithm is proposed using Kriging metamodel, where an unsupervised algorithm is used to select training samples from random samples for the first and second iterations. Then, the metamodel is improved iteratively by enriching the concerned domain with samples near the limit state function and samples obtained from a space-filling design. Hence, rapid convergence with the minimum number of function calls occurs using this active learning algorithm. An efficient stopping criterion has been developed to avoid premature or late-mature terminations of the metamodel and to regulate the accuracy of the failure probability estimations. The efficacy of this algorithm is examined using relative error, number of function calls, and coefficient of efficiency in five examples which are based on high-dimensional and low-failure probability with random and interval variables. •An active learning algorithm is proposed to estimate failure probability with less computational effort.•A stopping criterion is suggested to overcome the shortcoming of premature for high-dimensional and low-failure probability problems.•The efficacy of the active learning procedure is examined using relative error (∈Pf), number of function calls (Ncall), and coefficient of efficiency (CoE).
ISSN:	0266-8920
DOI:	10.1016/j.probengmech.2024.103662