Complexity Estimates for Severely Ill-posed Problems under A Posteriori Selection of Regularization Parameter

    Sergii G. Solodky Info
    Ganna L. Myleiko Info
    Evgeniya V. Semenova Info

Abstract

In the article the authors developed two efficient algorithms for solving severely ill-posed problems such as Fredholm’s integral equations. The standard Tikhonov method is applied as a regularization. To select a regularization parameter we employ two different a posteriori rules, namely, discrepancy and balancing principles. It is established that proposed strategies not only achieved optimal order of accuracy on the class of problems under consideration, but also they are economical in the sense of used discrete information.

Keywords:

severely ill-posed problem, complexity, Galerkin’s information, discrepancy principle, balancing principle

How to Cite

Solodky, S. G., Myleiko, G. L., & Semenova, E. V. (2017). Complexity Estimates for Severely Ill-posed Problems under A Posteriori Selection of Regularization Parameter. Mathematical Modelling and Analysis, 22(3), 283-299. https://doi.org/10.3846/13926292.2017.1307284

Share

Published in Issue
May 19, 2017
Abstract Views
604

View article in other formats

CrossMark check

CrossMark logo

Published

2017-05-19

Issue

Section

Articles

How to Cite

Solodky, S. G., Myleiko, G. L., & Semenova, E. V. (2017). Complexity Estimates for Severely Ill-posed Problems under A Posteriori Selection of Regularization Parameter. Mathematical Modelling and Analysis, 22(3), 283-299. https://doi.org/10.3846/13926292.2017.1307284

Share