Skip to main navigation Skip to search Skip to main content

A data-driven CUF-based beam model based on the tree-search algorithm

  • Yanchuan Hui
  • , Xiaowei Bai
  • , Yichen Yang
  • , Jie Yang*
  • , Qun Huang*
  • , Xiao Liu
  • , Wei Huang
  • , Gaetano Giunta
  • , Heng Hu
  • *Corresponding author for this work
  • Shenyang Univ
  • Luxembourg Inst Sci & Technol

Research output: Contribution to journal › Article › peer-review

27 Scopus citations

Abstract

Data-driven Computational Mechanics (DDCM) has been proposed as a new computational paradigm in recent years. Most of the DDCM models are discretised in the FEM framework. In this paper, two strategies are employed in the framework of DDCM to improve computational efficiency. Firstly, an advanced structural theory, Carrera Unified Formula, is used to build the numerical model, which reduces the computational cost (amount of gauss points) and the number of iterations. Secondly, the tree-search algorithm is employed to build the hierarchical database, which speeds up the data searching efficiency. The corresponding results are compared with the FEM model, FE2 model and FEM-based data-driven model to verify the proposed scheme. Some numerical cases have been conducted to demonstrate the validation and robustness of the hierarchical database.
Original languageEnglish
Article number116123
Number of pages13
JournalComposite Structures
Volume300
Early online dateAug 2022
DOIs
StatePublished - 15 Nov 2022

Funding

This work has been supported by the National Natural Science Foun-dation of China (Grant Nos. 11920101002, 12102269 and 52078306) , National Expert Project of China (G2022007004L) and Shenyang Sci-ence and Technology Project, China (21-108-9-21) .

Keywords

  • Data-driven
  • Multi-layer database
  • Data search
  • Carrera unified formula

Indexed by

  • Scopus
  • EI
  • SCIE

Fingerprint

Dive into the research topics of 'A data-driven CUF-based beam model based on the tree-search algorithm'. Together they form a unique fingerprint.

Cite this