Comparative analysis of inverse coefficient problems for parabolic equations. Part III: Conjugate gradient method and coarse-fine grid algorithm

Alemdar Hasanov, Burhan Pektaş

2011

Closed access Metadata (CSL-JSON)
DOI 10.1080/17415977.2011.579607
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

This article presents a computational analysis of the Conjugate Gradient Method (CGM), and a comparative analysis of the method (CGM) and coarse-fine grid algorithm (CFGA) for parabolic inverse coefficient problems (ICPs) based on boundary measured data. The adjoint problem approach is applied to obtain formal gradients of each ICPs as the L2-scalar product of the derivatives ux(x, t; k) and ϕx(x, t; k) of the corresponding direct and adjoint problems. Then the CGM is applied to the least-squares formulation of the inverse coefficient problems. Detailed numerical study of the method for each ICP is presented for various types of type input data concentrated at the boundary. Comparative computational analysis of the CGM and CFGA shows the limits of applications and effectiveness of each these methods.