Jump to ContentJump to Main Navigation

Online

249,00 € / $374.00*

* Prices subject to change. Shipping costs will be added if applicable.
Publication Date:
May 2006
ISSN:
1569-3945
DOI:
10.1515/156939406777340928

See all formats and pricing

Online
Individual Subscription Online only
Euro [D] 249.00
RRP for USA, Canada, Mexico
US$ 374.00 *
Print
Individual Subscription Online only
Euro [D] 1686.00
RRP for USA, Canada, Mexico
US$ 2529.00 *
Print + Online
Individual Subscription Online only
Euro [D] 2024.00
RRP for USA, Canada, Mexico
US$ 3035.00 *
*Prices subject to change. Shipping costs will be added if applicable.

Editor-in-Chief: Kabanikhin, Sergey I.

6 Issues per year

IMPACT FACTOR 2011: 0.432

Mathematical Citation Quotient 2011: 0.40

VolumeIssuePage

Issues

On the choice of the regularization parameter in ill-posed problems with approximately given noise level of data

U. Hämarik / T. Raus

Institute of Applied Mathematics, University of Tartu, Estonia. E-mails: uno.hamarik@ut.ee, toomas.raus@ut.ee

Citation Information: Journal of Inverse and Ill-posed Problems jiip. Volume 14, Issue 3, Pages 251–266, ISSN (Online) 1569-3953, ISSN (Print) 0928-0219, DOI: 10.1515/156939406777340928,

Publication History:
Published Online:

We consider regularization of linear ill-posed problems Au = ƒ in Hilbert spaces. Approximations u r to the solution u * can be constructed by the Tikhonov method or by the Lavrentiev method, by iterative or by other methods. We assume that instead of ƒ ∈ R(A) noisy data are available with the approximately given noise level δ: in process δ → 0 it holds || − ƒ||/δc with unknown constant c. We propose a new a-posteriori rule for the choice of the regularization parameter r = r(δ) guaranteeing u r(δ)u * for δ → 0. Note that such convergence is not guaranteed for the parameter choice given by the L-curve rule, by the GCV-rule, by the quasioptimality criterion and also for discrepancy principle ||Au r|| = with b < c. The error estimates are given, which in case || − ƒ|| ≤ δ are quasioptimal and order-optimal.

Comments (0)

Please log in or register to comment.