# Algorithms for the approximate solution of ill-posed problems on special sets

Chapter

## Abstract

In Chapter 2 we have succeeded in solving, in a number of cases, the first problem posed to us: starting from qualitative information regarding the unknown solution, how to find the compact set of well-posedness *M* containing the exact solution. It was shown that this can be readily done if the exact solution of the problem belongs to *Z*↓_{ C }, *Ž* _{ C }, *Ž*↓_{ C }. A uniform approximation to the exact solution of the problem can be constructed if the exact solution is a continuous function of bounded variation. We now turn to the second problem: how to construct an efficient numerical algorithm for solving ill-posed problems on the sets listed above?

## Keywords

Exact Solution Approximate Solution Conjugate Gradient Active Constraint Convex Polyhedron
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

## Preview

Unable to display preview. Download preview PDF.

## Copyright information

© Springer Science+Business Media Dordrecht 1995