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:
| File | Dimensione | Formato | |
|---|---|---|---|
|
2015-ErbSemenova.pdf
Accesso riservato
Tipologia:
Published (Publisher's Version of Record)
Licenza:
Accesso privato - non pubblico
Dimensione
462.59 kB
Formato
Adobe PDF
|
462.59 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
