In this paper, we investigate an adaptive discretization strategy for ill-posed linear problems combined with a regularization from a class of semiiterative methods. We show that such a discretization approach in combination with a stopping criterion as the discrepancy principle or the balancing principle yields an order optimal regularization scheme and allows to reduce the computational costs.

On adaptive discretization schemes for the solution of ill-posed problems with semiiterative methods

Erb W.
;
2015

Abstract

In this paper, we investigate an adaptive discretization strategy for ill-posed linear problems combined with a regularization from a class of semiiterative methods. We show that such a discretization approach in combination with a stopping criterion as the discrepancy principle or the balancing principle yields an order optimal regularization scheme and allows to reduce the computational costs.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11577/3369002
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 3
  • ???jsp.display-item.citation.isi??? 3
social impact