A scaled boundary finite element method and Woodbury formula-based algorithm to solve an inverse heat conduction problem with crack identification

Purpose The presented work focuses on the crack identification under the Fourier heat conduction framework so as to provide an efficient numerical algorithm to predict potential failure risks induced by cracks. Design/methodology/approach The identification is conducted by solving a geometric inverse heat conduction problem (IHCP). The forward problem is formulated by SBFEM, which is convenient and efficient to tackle with the crack-induced heat flux singularity. By leveraging SBFEM, a crack can geometrically be represented in a super SBFEM element, and its position can be characterized by sets of coordinates which need to be identified. Findings The proposed approach is verified via numerical examples, in which cracks either on the boundary or inside the domain can be effectively identified and impacts of noisy data, identification resolution, layout of measurement points, etc. are taken into account. Originality/value An SBFEM-based geometric representation is presented to characterize edge and internal cracks with sets of representative coordinates. Due to the locality of the crack, a partitioned heat conduction matrix is derived for which only its small part needs to be updated. A Woodbury formula-based algorithm is developed to reduce the solution scale of the inverse heat conduction matrix. Highlights

Institutions

Publication Details

Journal
Engineering Computations
Published
2025-10-23
DOI
https://doi.org/10.1108/ec-08-2024-0785
Primary Topic
Numerical methods in inverse problems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A scaled boundary finite element method and Woodbury formula-based algorithm to solve an inverse heat conduction problem with crack identification

Engineering Computations
Numerical methods in inverse problems
article

A scaled boundary finite element method and Woodbury formula-based algorithm to solve an inverse heat conduction problem with crack identification

article en

Abstract

Purpose The presented work focuses on the crack identification under the Fourier heat conduction framework so as to provide an efficient numerical algorithm to predict potential failure risks induced by cracks. Design/methodology/approach The identification is conducted by solving a geometric inverse heat conduction problem (IHCP). The forward problem is formulated by SBFEM, which is convenient and efficient to tackle with the crack-induced heat flux singularity. By leveraging SBFEM, a crack can geometrically be represented in a super SBFEM element, and its position can be characterized by sets of coordinates which need to be identified. Findings The proposed approach is verified via numerical examples, in which cracks either on the boundary or inside the domain can be effectively identified and impacts of noisy data, identification resolution, layout of measurement points, etc. are taken into account. Originality/value An SBFEM-based geometric representation is presented to characterize edge and internal cracks with sets of representative coordinates. Due to the locality of the crack, a partitioned heat conduction matrix is derived for which only its small part needs to be updated. A Woodbury formula-based algorithm is developed to reduce the solution scale of the inverse heat conduction matrix. Highlights

Engineering ComputationsVol. 42(10)
Dalian University of Technology (CN)
Openalex Percentile: Top 40%
Numerical methods in inverse problems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.