Skip to content
Licensed Unlicensed Requires Authentication Published by De Gruyter November 21, 2008

Relative computational efficiency of iteratively regularized methods

  • A. B. Bakushinsky , A. Smirnova and N. Tuncer

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.

Received: 2008-02-28
Revised: 2008-03-05
Published Online: 2008-11-21
Published in Print: 2008-November

© de Gruyter 2008

Downloaded on 29.3.2024 from https://www.degruyter.com/document/doi/10.1515/JIIP.2008.041/html
Scroll to top button