Volume 21 (2013)
Volume 20 (2012)
Volume 19 (2011)
Volume 18 (2011)
Volume 17 (2009)
Volume 16 (2008)
Volume 15 (2007)
Volume 14 (2006)
Volume 13 (2005)
Volume 12 (2004)
Volume 11 (2003)
Volume 10 (2002)
Volume 9 (2001)
Volume 8 (2000)
Volume 7 (1999)
Volume 6 (1998)
Volume 5 (1997)
Volume 4 (1996)
Volume 3 (1995)
Volume 2 (1994)
Most Downloaded Articles
- Expanding the applicability of Tikhonov's regularization and iterative approximation for ill-posed problems by Vasin, Vladmir and George, Santhosh
- An adjoint method for proving identifiability of coefficients in parabolic equations by DuChateau, Paul
- Complexity analysis of the iteratively regularized Gauss–Newton method with inner CG-iteration by Langer, S.
- Cauchy problem for partial differential equations with operator coefficients in space by FAYAZOV, K. S. and LAVRENTEV, M. M.
- Uniqueness theorems for the exponential X-ray transform by SHARAFUTDINOV, V. A.
Relative computational efficiency of iteratively regularized methods
1Institute of System Analysis Russian Academy of Sciences, 117312 Moscow, Russia. Email: (email)
2Dept. of Mathematics and Statistics, Georgia State University, Atlanta, GA 30303, USA. Email: (email)
3Dept. of Mathematics and Statistics, Georgia State University, Atlanta, GA 30303, USA. Email: (email)
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: 10.1515/JIIP.2008.041, November 2008
- Published Online:
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.