Article
Licensed
Unlicensed
Requires Authentication
A globally convergent convexification algorithm for multidimensional coefficient inverse problems
-
M. V. Klibanov
Published/Copyright:
May 25, 2007
Computational results for the convexification algorithm of the authors are presented in the 2-Dimensional case. Convexification is a numerical method for some multidimensional coefficient inverse problems with rigorously guaranteed global convergence.
Published Online: 2007-05-25
Published in Print: 2007-05-23
Copyright 2007, Walter de Gruyter
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Parameter estimation versus homogenization techniques in time-domain characterization of composite dielectrics
- Optimal regularization for ill-posed problems in metric spaces
- A dual algorithm for denoising and preserving edges in image processing
- A globally convergent convexification algorithm for multidimensional coefficient inverse problems
- Numerical solution of inverse heat conduction problems in two spatial dimensions
- Imaging low sensitivity regions in petroleum reservoirs using topological perturbations and level sets
Articles in the same Issue
- Parameter estimation versus homogenization techniques in time-domain characterization of composite dielectrics
- Optimal regularization for ill-posed problems in metric spaces
- A dual algorithm for denoising and preserving edges in image processing
- A globally convergent convexification algorithm for multidimensional coefficient inverse problems
- Numerical solution of inverse heat conduction problems in two spatial dimensions
- Imaging low sensitivity regions in petroleum reservoirs using topological perturbations and level sets
