Relative computational efficiency of iteratively regularized methods
regularizationinverse problemnumerical examplesHilbert spacenonlinear operator equationGauss-Newton methodradiative transport equationoptical tomographyFréchet and Gâteaux derivativesill-posed optical tomography inverse problem
Complexity and performance of numerical algorithms (65Y20) Biomedical imaging and signal processing (92C55) Numerical methods for inverse problems for boundary value problems involving PDEs (65N21) Boundary value problems for second-order elliptic equations (35J25) Nonlinear ill-posed problems (47J06) Numerical solutions to equations with nonlinear operators (65J15) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20)
- Inverse problem in optical tomography and its numerical investigation by iteratively regularized methods
- Iterative methods for ill-posed problems. An introduction.
- Complexity analysis of the iteratively regularized Gauss-Newton method with inner CG-iteration
- The analysis of a discrete scheme of the iteratively regularized Gauss-Newton method
- Analysis of approximate inverses in tomography. II: Iterative inverses
- A modified Landweber iteration for solving parameter estimation problems
- Convergence and application of a modified iteratively regularized Gauss–Newton algorithm
- Inverse problem in optical tomography and its numerical investigation by iteratively regularized methods
- Inverse problem in refractive index based optical tomography
- Optical tomography in medical imaging
This page was built for publication: Relative computational efficiency of iteratively regularized methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548643)
