NUMERICAL SOLUTIONS OF THE DIFFUSION COEFFICIENT IDENTIFICATION PROBLEM
Abstract: 53
| 
PDF: 28 
##plugins.themes.academic_pro.article.main##
Author
Keywords:
sparsity regularization
energy functional
diffusion coefficient identification problem
Gradient-type algorithm
Nesterov’s accelerated algorithm
Beck’s accelerated algorithms
numerical solution
Abstract
In this paper, we investigate several numerical algorithms to find the numerical solutions of the diffusion coefficient identification problem. Normally, in order to solve this problem, one uses the least squares function together with a regularization method, butwe here use the energy functional with parsity regularization method. Our approach leads to the study of a minimum convexproblem (but not differentiable). Therefore, we can apply some fast and efficient algorithms, which has been proposed recently. The main results presented in the paper is to give the new approach and to implement the efficient algorithms to find the numerical solutions of the diffusion coefficient identification problem. The effectiveness of the algorithms and the numerical solutions are illustrated and presented in a specific example.
References
-
[1] A. Beck and M. Teboulle. A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci., 2(1):183–202, 2009.
[2] T. F. Chan and X. Tai. Identification of discontinuous coefficients in ellptic problems using total variation regularization. SIAM J. Sci. Comput., 25(3):881–904, 2003.
[3] H. W. Engl, M. Hanke, and A. Neubauer. Regularization of Inverse Problems. Kluwer, Dordrecht, 1996.
[4] M. Grasmair, M. Haltmeier, and O. Scherer. Sparsity regularization with penalty term. Inverse Problems, 24:055020, 2008.
[5] D. N. Hào and T. N. T. Quyen. Convergence rates for Tikhonov regularization of coefficient identification problems in Laplace-type equation. Inverse Problems, 26:125014, 2010.
[6] I. Knowles. Parameter identification for elliptic problems. Journal of Computational and Applied Mathematics, 131:175–194, 2001.
[7] D.A. Lorenz, P. Maass, and P.Q. Muoi. Gradient descent for Tikhonov functionals with sparsity constraints: Theory and numerical comparison of step size rules. Electronic Transactions on Numerical Analysis, 39:437–463, 2012.
[8] P. Q. Muoi. Sparsity regularization of the diffusion coefficient identification problem: well-posedness and convergence rates. Bulletin of the Malaysian Mathematical Sciences Society, 2014. to appear.
[9] Y. Nesterov. Gradient methods for minimizing composite objective function. Technical report, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE), 2007.
[10] J. Zou. Numerical methods for elliptic inverse problems. International Journal of Computer Mathematics, 70:211–232, 1998.
Read more
##plugins.themes.academic_pro.article.sidebar##
Published
Jun 30, 2014
Download
How to Cite
Pham Quy Muoi*; Nguyen Thanh Tuan. “NUMERICAL SOLUTIONS OF THE DIFFUSION COEFFICIENT IDENTIFICATION PROBLEM”. The University of Danang - Journal of Science and Technology, vol. 6, no. 79.1, June 2014, pp. 35-38, https://jst-ud.vn/jst-ud/article/view/533.
