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.
Published Version (Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.