Sequential Inverse Heat Conduction Problem in OpenFOAM

  • Bohacek J
  • Kominek J
  • Vakhrushev A
  • et al.
N/ACitations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

The solution of the inverse heat conduction problem (IHCP) is commonly found with the sequential algorithm known as the function specification method with explicit updating formulas and sensitivity coefficients of heat flux. This paper presents a different approach namely a direct mathematical optimization of minimizing the least squares norm between experimental data and simulation. A CFD open-source code OpenFOAM is used together with NLOPT and DLIB optimization libraries. To guarantee credibility of the simulation tool developed herein, real experimental data is used from spray cooling of a fast-moving hot steel plate. As the IHCP is inherently an ill-posed problem, the proposed sequential algorithm is stabilized using future time stepping and thereof the optimal number is explained. An assumption about the profile of thermal boundary condition during future steps must be made. It is shown that assuming a linear change of the heat transfer coefficient during each sequence of future time steps yields more accurate results than setting a constant value. For the problem size considered with less than 10k cells, the preconditioned conjugate gradient (FDIC) linear solver converges faster than the multigrid solver (GAMG). However, the latter performs better as the accuracy is concerned. Concerning the best choice of minimizer, the BOBYQA algorithm (quadratic approximation) is found superior to other methods. The proposed IHCP solver is compared with the well-established one.

Cite

CITATION STYLE

APA

Bohacek, J., Kominek, J., Vakhrushev, A., Karimi-Sibaki, E., & Lee, T. (2021). Sequential Inverse Heat Conduction Problem in OpenFOAM. OpenFOAM® Journal, 1, 27–46. https://doi.org/10.51560/ofj.v1.33

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free