Numerical Methods for the Solution of Ill-Posed Problems

1. Regularization methods.- 2. Numerical methods for the approximate solution of ill-posed problems on compact sets.- 3. Algorithms for the approximate solution of ill-posed problems on special sets.- 4. Algorithms and programs for solving linear ill-posed problems.- Appendix: Program listings.- I. Program for solving Fredholm integral equations of the first kind, using Tikhonov’s method with transformation of the Euler equation to tridiagonal form.- II. Program for solving Fredholm integral equations of the first kind by Tikhonov’s method, using the conjugate gradient method.- III. Program for solving Fredholm integral equations of the first kind on the set of nonnegative functions, using the regularization method.- IV. Program for solving one-dimensional integral equations of convolution type.- V. Program for solving two-dimensional integral equations of convolution type.- VI. Program for solving Fredholm integral equations of the first kind on the sets of monotone and (or) convex functions. The method of the conditional gradient.- VII. Program for solving Fredholm integral equations of the first kind on the sets of monotone and (or) convex functions. The method of projection of conjugate gradients.- VIII. Program for solving Fredholm integral equations of the first kind on the sets of monotone and (or) convex functions. The method of projection of conjugate gradients onto the set of vectors with nonnegative coordinates.- IX. General programs.- Postscript.- 1. Variational methods.- 2. Iterative methods.- 3. Statistical methods.- 4. Textbooks.- 5. Handbooks and Conference Proceedings.