2004
DOI: 10.1016/j.camwa.2004.06.004
|View full text |Cite
|
Sign up to set email alerts
|

Identification of source terms in 2-D IHCP

Abstract: We introduce a stable numerical space marching scheme based on discrete mollification-implemented as an automatic adaptive filter--for the approximate identification of temperature, temperature gradient, and source terms in the two-dimensional inverse heat conduction problem (IHCP).The stability and error analysis of the algorithm, together with some numerical examples, are provided. (~)

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
9
0

Year Published

2008
2008
2018
2018

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 32 publications
(9 citation statements)
references
References 6 publications
0
9
0
Order By: Relevance
“…As we know, there has been lots of research on identification of heat source adopting numerical algorithms [9][10][11][12][13][14][15][16]. But to the author's knowledge there are few papers, using the regularization method, with strict theoretical analysis, on identifying the heat source.…”
Section: Introductionmentioning
confidence: 96%
“…As we know, there has been lots of research on identification of heat source adopting numerical algorithms [9][10][11][12][13][14][15][16]. But to the author's knowledge there are few papers, using the regularization method, with strict theoretical analysis, on identifying the heat source.…”
Section: Introductionmentioning
confidence: 96%
“…As we know, there is a lot of research on identification of heat source adopted numerical algorithms, such as the mollification method [8,9], the finite difference method [10,11], the modified genetic algorithm [12], the meshless method [13] and the conditional stability [14,15]. But by the regularization method, there are a few papers with strict theoretical analysis on identifying the heat source.…”
Section: Introductionmentioning
confidence: 98%
“…Applications of one-dimensional mollification methods are found, for instance, in References [6][7][8]. Mollification in two dimensions is less common and it is worth mentioning that it serves as a smoothing operator in Reference [9], appears as an accelerator of explicit schemes in Reference [4], and is a regularization tool for an identification problem in Reference [10].…”
Section: Introductionmentioning
confidence: 99%