S. G. Solodky / E. V. Lebedeva
1Institute of Mathematics, National Academy of Sciences of Ukraine, Tereshscenkivska Str. 3, 01601 Kiev, Ukraine. Email: solodky@imath.kiev.ua
1Institute of Mathematics, National Academy of Sciences of Ukraine, Tereshscenkivska Str. 3, 01601 Kiev, Ukraine. Email: djecsa@imath.kiev.ua
Citation Information: Journal of Inverse and Ill-posed Problems. Volume 16, Issue 2, Pages 195–207, ISSN (Online) 1569-3945, ISSN (Print) 0928-0219, DOI: 10.1515/JIIP.2008.012, May 2008
Abstract
A class of approximate methods to solve operator equations of first kind with not exactly given input data is constructed. For involved methods their optimality by the order on sets of sourcewise represented solutions is proved and the bound of informational expenses is obtained. These algorithms are numerically implemented in an efficient way. An example of application of two such algorithms is given.
Comments (0)