Discretized Tikhonov regularization by reproducing kernel Hilbert space for backward heat conduction problem
نویسندگان
چکیده
In this paper we propose a numerical reconstruction method for solving a backward heat conduction problem. Based on the idea of reproducing kernel approximation, we reconstruct the unknown initial heat distribution from a finite set of scattered measurement of transient temperature at a fixed final time. Standard Tikhonov regularization technique using the norm of reproducing kernel is adopt to provide a stable solution when the measurement data contain noises. Numerical results indicate that the proposed method is stable, efficient, and accurate.
منابع مشابه
Tikhonov Regularization by a Reproducing Kernel Hilbert Space for the Cauchy Problem for an Elliptic Equation Tikhonov Regularization by a Reproducing Kernel Hilbert Space for the Cauchy Problem for an Elliptic Equation
We propose a discretized Tikhonov regularization for a Cauchy problem for an elliptic equation by a reproducing kernel Hilbert space. We prove the convergence of discretized regularized solutions to an exact solution. Our numerical results demonstrate that our method can stably reconstruct solutions to the Cauchy problems even in severe cases of geometric configurations.
متن کاملA regularization method for solving a nonlinear backward inverse heat conduction problem using discrete mollification method
The present essay scrutinizes the application of discrete mollification as a filtering procedure to solve a nonlinear backward inverse heat conduction problem in one dimensional space. These problems are seriously ill-posed. So, we combine discrete mollification and space marching method to address the ill-posedness of the proposed problem. Moreover, a proof of stability and<b...
متن کاملTikhonov Regularization Parameter in Reproducing Kernel Hilbert Spaces with Respect to the Sensitivity of the Solution
In our paper, we consider Tikhonov regularization in the reproducing Kernel Hilbert Spaces. In this space we derive upper and lower bound of the interval which contains the optimal value of Tikhonov regularization parameter with respect to the sensitivity of the solution without computing the singular values of the corresponding matrix. For the case of normalized kernel, we give an explicit for...
متن کاملKernel Least Mean Square Algorithm
A simple, yet powerful, learning method is presented by combining the famed kernel trick and the least-mean-square (LMS) algorithm, called the KLMS. General properties of the KLMS algorithm are demonstrated regarding its well-posedness in very high dimensional spaces using Tikhonov regularization theory. An experiment is studied to support our conclusion that the KLMS algorithm can be readily u...
متن کاملReproducing Kernel Hilbert Space(RKHS) method for solving singular perturbed initial value problem
In this paper, a numerical scheme for solving singular initial/boundary value problems presented.By applying the reproducing kernel Hilbert space method (RKHSM) for solving these problems,this method obtained to approximated solution. Numerical examples are given to demonstrate theaccuracy of the present method. The result obtained by the method and the exact solution are foundto be in good agr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Adv. Comput. Math.
دوره 34 شماره
صفحات -
تاریخ انتشار 2011