A. Goncharsky – författare

This volume presents a unified approach to the solution of ill-posed problems, based on the concept of a regularizing algorithm (RA). This idea is then explored in the discussion of topics such as common conditions for the existence of regularizing algorithms, necessary and sufficient conditions of the approximations for linear problems, and the principle of iterative regularization for nonlinear problems. The majority of these issues have not previously been discussed in a monograph on ill-posed problems. The efficiency of many of the suggested algorithms should prove useful in their application to a wide range of practical problems. This volume can be read by anyone with a basic knowledge of functional analysis. This book should be of interest to applied mathematicians, engineers, and specialists in inverse problems.

Many problems in science, technology and engineering are posed in the form of operator equations of the first kind, with the operator and RHS approximately known. But such problems often turn out to be ill-posed, having no solution, or a non-unique solution, and/or an unstable solution. Non-existence and non-uniqueness can usually be overcome by settling for `generalised' solutions, leading to the need to develop regularising algorithms. The theory of ill-posed problems has advanced greatly since A. N. Tikhonov laid its foundations, the Russian original of this book (1990) rapidly becoming a classical monograph on the topic. The present edition has been completely updated to consider linear ill-posed problems with or without a priori constraints (non-negativity, monotonicity, convexity, etc.). Besides the theoretical material, the book also contains a FORTRAN program library. Audience: Postgraduate students of physics, mathematics, chemistry, economics, engineering. Engineers and scientists interested in data processing and the theory of ill-posed problems.

Many problems in science, technology and engineering are posed in the form of operator equations of the first kind, with the operator and RHS approximately known. But such problems often turn out to be ill-posed, having no solution, or a non-unique solution, and/or an unstable solution. Non-existence and non-uniqueness can usually be overcome by settling for 'generalised' solutions, leading to the need to develop regularising algorithms. The theory of ill-posed problems has advanced greatly since A. N. Tikhonov laid its foundations, the Russian original of this book (1990) rapidly becoming a classical monograph on the topic. The present edition has been completely updated to consider linear ill-posed problems with or without a priori constraints (non-negativity, monotonicity, convexity, etc.). Besides the theoretical material, the book also contains a FORTRAN program library. Audience: Postgraduate students of physics, mathematics, chemistry, economics, engineering. Engineers and scientists interested in data processing and the theory of ill-posed problems.

Recent years have been characterized by the increasing amountofpublications in the field ofso-called ill-posed problems. This is easilyunderstandable because we observe the rapid progress of a relatively young branch ofmathematics, ofwhich the first results date back to about 30 years ago. By now, impressive results have been achieved both in the theory ofsolving ill-posed problems and in the applicationsofalgorithms using modem computers. To mention just one field, one can name the computer tomography which could not possibly have been developed without modem tools for solving ill-posed problems. When writing this book, the authors tried to define the place and role of ill­ posed problems in modem mathematics. In a few words, we define the theory of ill-posed problems as the theory of approximating functions with approximately given arguments in functional spaces. The difference between well-posed and ill­ posed problems is concerned with the fact that the latter are associated with discontinuous functions. This approach is followed by the authors throughout the whole book. We hope that the theoretical results will be of interest to researchers working in approximation theory and functional analysis. As for particular algorithms for solving ill-posed problems, the authors paid general attention to the principles ofconstructing such algorithms as the methods for approximating discontinuous functions with approximately specified arguments. In this way it proved possible to define the limits of applicability of regularization techniques.

Recent years have been characterized by the increasing amountofpublications in the field ofso-called ill-posed problems. This is easilyunderstandable because we observe the rapid progress of a relatively young branch ofmathematics, ofwhich the first results date back to about 30 years ago. By now, impressive results have been achieved both in the theory ofsolving ill-posed problems and in the applicationsofalgorithms using modem computers. To mention just one field, one can name the computer tomography which could not possibly have been developed without modem tools for solving ill-posed problems. When writing this book, the authors tried to define the place and role of ill­ posed problems in modem mathematics. In a few words, we define the theory of ill-posed problems as the theory of approximating functions with approximately given arguments in functional spaces. The difference between well-posed and ill­ posed problems is concerned with the fact that the latter are associated with discontinuous functions. This approach is followed by the authors throughout the whole book. We hope that the theoretical results will be of interest to researchers working in approximation theory and functional analysis. As for particular algorithms for solving ill-posed problems, the authors paid general attention to the principles ofconstructing such algorithms as the methods for approximating discontinuous functions with approximately specified arguments. In this way it proved possible to define the limits of applicability of regularization techniques.