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
Inglese
337
386
398
13
Esperti anonimi
internazionale
scientifica
Bregman iteration; Ill-posed problem; preconditioning; regularization
Buccini, A.; Park, Y.; Reichel, L.
1.1 Articolo in rivista
info:eu-repo/semantics/article
1 Contributo su Rivista::1.1 Articolo in rivista
262
3
open
Files in This Item:
File Size Format  
NMLBA.pdf

open access

Type: versione pre-print
Size 246.84 kB
Format Adobe PDF
246.84 kB Adobe PDF View/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Questionnaire and social

Share on:
Impostazioni cookie