The solution of discrete ill-posed problems has been a subject of research for many years. Among the many methods described in the literature, the Bregman algorithm has attracted a great deal attention and been widely investigated. Recently, a nonstationary preconditioned version of this algorithm, referred to as the nonstationary modified linearized Bregman algorithm, was proposed. The aim of this paper is to discuss numerical aspects of this algorithm and to compare computed results with known theoretical properties. We also discuss the effect of several parameters required by the algorithm on the computed solution. (C)

Numerical aspects of the nonstationary modified linearized Bregman algorithm

Buccini A.;Reichel L.
2018-01-01

Abstract

The solution of discrete ill-posed problems has been a subject of research for many years. Among the many methods described in the literature, the Bregman algorithm has attracted a great deal attention and been widely investigated. Recently, a nonstationary preconditioned version of this algorithm, referred to as the nonstationary modified linearized Bregman algorithm, was proposed. The aim of this paper is to discuss numerical aspects of this algorithm and to compare computed results with known theoretical properties. We also discuss the effect of several parameters required by the algorithm on the computed solution. (C)
2018
Bregman iteration; Ill-posed problem; preconditioning; regularization
File in questo prodotto:
File Dimensione Formato  
NMLBA.pdf

accesso aperto

Tipologia: versione pre-print
Dimensione 246.84 kB
Formato Adobe PDF
246.84 kB Adobe PDF Visualizza/Apri

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/11584/278186
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 11
  • ???jsp.display-item.citation.isi??? 8
social impact