2013
DOI: 10.5899/2013/cna-00172
|View full text |Cite
|
Sign up to set email alerts
|

Numerical simulations of 1D inverse heat conduction problems using overdetermined RBF-MLPG method

Abstract: This paper proposes a numerical method to deal with the one-dimensional inverse heat conduction problem (IHCP). The initial temperature, a condition on an accessible part of the boundary and an additional temperature measurements in time at an arbitrary location in the domain are known, and it is required to determine the temperature and the heat flux on the remaining part of the boundary. Due to the missing boundary condition, the solution of this problem does not depend continuously on the data and therefore… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 27 publications
0
2
0
Order By: Relevance
“…They derived six MLPG formulations depending on various test functions applied and marked them MLPG1-MLPG6. The success of the MLPG method has been reported in solving several engineering problems; see [14,7,[15][16][17][18][19][20] and the references therein. A local meshless method based on the use of Radial Basis Functions (RBF) and collocation approach was proposed in [21].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…They derived six MLPG formulations depending on various test functions applied and marked them MLPG1-MLPG6. The success of the MLPG method has been reported in solving several engineering problems; see [14,7,[15][16][17][18][19][20] and the references therein. A local meshless method based on the use of Radial Basis Functions (RBF) and collocation approach was proposed in [21].…”
Section: Introductionmentioning
confidence: 99%
“…(1.5) via a local meshless method. Meshless methods [7][8][9][10][11][15][16][17][18][19][20] are very attractive and effective for solving boundary value problems, because they involve simple preprocessing, arbitrary node distribution and flexibility of placing nodes at arbitrary locations, straightforward adaptive refinement, versatility in solving large deformation and also have the high order continuity and the ability to treat the evolution of non-smooth solutions, which is very useful to solve PDE problems. Many of them are derived from a weak-form formulation on a global domain or a set of local subdomains.…”
Section: Introductionmentioning
confidence: 99%