Loading…

Identification of unknown diffusion coefficient in pure diffusive linear model of chronoamperometry. II. Numerical implementation

This article presents numerical implementation of the approach proposed in the previous study ( Identification of the unknown diffusion coefficient in ion transport problem. I. The theory, Math. Chem . (2009) (submitted)) for the coefficient inverse problems related to linear diffusion equation in c...

Full description

Saved in:
Bibliographic Details
Published in:Journal of mathematical chemistry 2010-10, Vol.48 (3), p.508-520
Main Authors: Hasanov, Alemdar, Pektaş, Burhan
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This article presents numerical implementation of the approach proposed in the previous study ( Identification of the unknown diffusion coefficient in ion transport problem. I. The theory, Math. Chem . (2009) (submitted)) for the coefficient inverse problems related to linear diffusion equation in chronoamperometry. The coarse-fine grid algorithm is used for determination of the unknown diffusion coefficient D ( x ) in the linear parabolic equation u t  = ( D ( x ) u x ) x from the measured output data (left flux). The main distinguished feature of the implemented algorithm is the use of a fine grid for the numerical solution of well-posed forward and backward parabolic problems, and a coarse grid for the interpolation of the unknown diffusion coefficient D ( x ). The nodal values of the unknown coefficient on the coarse grid are recovered sequentially, solving on each step of the coarse grid iteration algorithm the well-posed forward, and the sequence of backward pababolic problems. This guarantees a compromise between the accuracy and stability of the solution of the considered inverse problem. An efficiency and applicability of the proposed approach is demonstrated on various numerical examples with noisy free and noisy data.
ISSN:0259-9791
1572-8897
DOI:10.1007/s10910-010-9687-1