z-logo
Premium
The comparative performance of some finite difference equations for transient heat conduction
Author(s) -
Bhattacharya M. C.,
Davies M. G.
Publication year - 1987
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/nme.1620240708
Subject(s) - transient (computer programming) , thermal conduction , finite difference , finite difference method , finite element method , mathematics , mechanics , physics , mathematical analysis , computer science , thermodynamics , operating system
The established finite difference equations to estimate one‐dimensional transient heat flow in solids are the ‘classical’ form (explicit), and the Crank–Nicolson and ‘pure‐implicit’ forms (both implicit). They are all based on finite difference approximation to the Fourier continuity equation. To these are now added three more explicit forms: exponential linear, exponential inverse cosine and polynomial, which are based on exact solutions to the Fourier equation. The performance of each of the six equations is tested against the exact results of a well known step excitations problem (the Groeber model). The tests consist of examining (i) finite difference errors arising from a single implementation of each form at different stages in the transient cooling process, (ii) the errors that accumulate during part or all of the cooling process (both as regards any bias that is introduced, and also a measure of variance) and (iii) the run times in executing the various forms. The nondimensional time step r was treated as the independent variable, and can be made arbitrarily large, by use of a simple time‐division procedure (otherwise r < ½ for use with the classical form). It is shown that having regard to both error and run time, the polynomial form appears to be the most efficient estimator.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here