Data Errors and an Error Estimation for Ill-Posed Problems
A. G. Yagola, A. S. Leonov, Valeriy Titarenko
Abstract
Open-access reader
A. G. Yagola, A. S. Leonov, Valeriy Titarenko
Abstract
Open-access reader
In this paper we shall discuss the problem how to use a priori information for constructing regularizing algorithms and error estimation while solving ill-posed problems. We shall consider the following types of a priori information: (1) a compactness of a set of solutions; (2) a sourcewise representation of a solution with a compact operator.
OpenAlex reports 49 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper we shall discuss the problem how to use a priori information for constructing regularizing algorithms and error estimation while solving ill-posed problems. We shall consider the following types of a priori information: (1) a compactness of a set of solutions; (2) a sourcewise representation of a solution with a compact operator.
Key concepts: A priori and a posteriori, Well-posed problem, Compact space, Mathematics, Representation (politics), Set (abstract data type), Operator (biology), Mathematical optimization