A numerical scheme based on discrete mollification method using Bernstein basis polynomials for solving the inverse one-dimensional Stefan problem

ABSTRACT

This paper concerns a one-phase inverse Stefan problem in one-dimensional space. The problem is ill-posed in the sense that the solution does not depend continuously on the data. We also consider noisy data for this problem. As such, we first regularize the proposed problem by the discrete mollification method. We apply the integration matrix using Bernstein basis polynomials for the discrete mollification method. Through this method, the execution time was gradually decreased. We then extend the space marching algorithm for solving our problem. Moreover, proofs of stability and convergence of the process are given. Finally, the results of this paper have been illustrated and examined by some numerical examples. Numerical examples confirm the efficiency of the proposed method.

Keywords:

• One-phase inverse Stefan problem
• discrete mollification
• Bernstein basis polynomials
• space marching algorithm
• stability
• convergence

2010 Mathematics Subject Classifications:

• 35R30
• 35R37
• 80A22