Jump to ContentJump to Main Navigation
Show Summary Details
More options …

Journal of Inverse and Ill-posed Problems

Editor-in-Chief: Kabanikhin, Sergey I.


IMPACT FACTOR 2017: 0.941
5-year IMPACT FACTOR: 0.953

CiteScore 2017: 0.91

SCImago Journal Rank (SJR) 2017: 0.461
Source Normalized Impact per Paper (SNIP) 2017: 1.022

Mathematical Citation Quotient (MCQ) 2017: 0.49

Online
ISSN
1569-3945
See all formats and pricing
More options …
Volume 16, Issue 7

Issues

Relative computational efficiency of iteratively regularized methods

A. B. Bakushinsky / A. Smirnova
  • Dept. of Mathematics and Statistics, Georgia State University, Atlanta, GA 30303, USA. Email:
  • Other articles by this author:
  • De Gruyter OnlineGoogle Scholar
/ N. Tuncer
  • Dept. of Mathematics and Statistics, Georgia State University, Atlanta, GA 30303, USA. Email:
  • Other articles by this author:
  • De Gruyter OnlineGoogle Scholar
Published Online: 2008-11-21 | DOI: https://doi.org/10.1515/JIIP.2008.041

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

About the article

Received: 2008-02-28

Revised: 2008-03-05

Published Online: 2008-11-21

Published in Print: 2008-11-01


Citation Information: Journal of Inverse and Ill-posed Problems, Volume 16, Issue 7, Pages 681–694, ISSN (Online) 1569-3945, ISSN (Print) 0928-0219, DOI: https://doi.org/10.1515/JIIP.2008.041.

Export Citation

Comments (0)

Please log in or register to comment.
Log in