Article
Licensed
Unlicensed
Requires Authentication
Relative computational efficiency of iteratively regularized methods
-
A. B. Bakushinsky
Published/Copyright:
November 21, 2008
Abstract
The estimates for the number of operations needed to implement two different iteratively regularized Gauss–Newton methods as well as the iteratively regularized gradient scheme are given. The operation count is illustrated by simulations for a two dimensional version of the exponentially ill-posed optical tomography inverse problem for the diffusion (D) and absorption (μa) coefficient spatial distributions.
Key words.: Regularization; Fréchet and Gâteaux derivatives; Gauss–Newton method; optical tomography
Received: 2008-02-28
Revised: 2008-03-05
Published Online: 2008-11-21
Published in Print: 2008-November
© de Gruyter 2008
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Localization algorithms for singularities of solutions to convolution equations of the first kind
- Unimprovable estimates of solutions for some classes of integral inequalities
- Relative computational efficiency of iteratively regularized methods
- Uniqueness of solution to an inverse problem for a semilinear system of partial differential equations
- Quasi-solution in inverse coefficient problems
- Inverse nodal problems for Sturm–Liouville operators on star-type graphs
- Fifth International Conference. Algorithmic Analysis of Unstable Problems (AAUP-2008)
Keywords for this article
Regularization;
Fréchet and Gâteaux derivatives;
Gauss–Newton method;
optical tomography
Articles in the same Issue
- Localization algorithms for singularities of solutions to convolution equations of the first kind
- Unimprovable estimates of solutions for some classes of integral inequalities
- Relative computational efficiency of iteratively regularized methods
- Uniqueness of solution to an inverse problem for a semilinear system of partial differential equations
- Quasi-solution in inverse coefficient problems
- Inverse nodal problems for Sturm–Liouville operators on star-type graphs
- Fifth International Conference. Algorithmic Analysis of Unstable Problems (AAUP-2008)
