• Ronny Ramlau, Lothar Reichel (Hg.)

ETNA - Electronic Transactions on Numerical Analysis

Bild


Electronic Transactions on Numerical Analysis (ETNA) is an electronic journal for the publication of significant new developments in numerical analysis and scientific computing. Papers of the highest quality that deal with the analysis of algorithms for the solution of continuous models and numerical linear algebra are appropriate for ETNA, as are papers of similar quality that discuss implementation and performance of such algorithms. New algorithms for current or new computer architectures are appropriate provided that they are numerically sound. However, the focus of the publication should be on the algorithm rather than on the architecture. The journal is published by the Kent State University Library in conjunction with the Institute of Computational Mathematics at Kent State University, and in cooperation with the Johann Radon Institute for Computational and Applied Mathematics of the Austrian Academy of Sciences (RICAM). Reviews of all ETNA papers appear in Mathematical Reviews and Zentralblatt für Mathematik. Reference information for ETNA papers also appears in the expanded Science Citation Index. ETNA is registered with the Library of Congress and has ISSN 1068-9613.

…

Verlag der Österreichischen Akademie der Wissenschaften
Austrian Academy of Sciences Press
A-1011 Wien, Dr. Ignaz Seipel-Platz 2
Tel. +43-1-515 81/DW 3420, Fax +43-1-515 81/DW 3400
https://verlag.oeaw.ac.at, e-mail: verlag@oeaw.ac.at

Bestellung/Order


Bild
ETNA - Electronic Transactions on Numerical Analysis



ISBN 978-3-7001-8258-0
Online Edition



Send or fax to your local bookseller or to:

Verlag der Österreichischen Akademie der Wissenschaften
Austrian Academy of Sciences Press
A-1011 Wien, Dr. Ignaz Seipel-Platz 2,
Tel. +43-1-515 81/DW 3420, Fax +43-1-515 81/DW 3400
https://verlag.oeaw.ac.at, e-mail: bestellung.verlag@oeaw.ac.at
UID-Nr.: ATU 16251605, FN 71839x Handelsgericht Wien, DVR: 0096385

Bitte senden Sie mir
Please send me
 
Exemplar(e) der genannten Publikation
copy(ies) of the publication overleaf


NAME


ADRESSE / ADDRESS


ORT / CITY


LAND / COUNTRY


ZAHLUNGSMETHODE / METHOD OF PAYMENT
    Visa     Euro / Master     American Express


NUMMER

Ablaufdatum / Expiry date:  

    I will send a cheque           Vorausrechnung / Send me a proforma invoice
 
DATUM, UNTERSCHRIFT / DATE, SIGNATURE

BANK AUSTRIA CREDITANSTALT, WIEN (IBAN AT04 1100 0006 2280 0100, BIC BKAUATWW), DEUTSCHE BANK MÜNCHEN (IBAN DE16 7007 0024 0238 8270 00, BIC DEUTDEDBMUC)
Bild

A simplified iterated Lavrentiev regularization method for nonlinear ill-posed monotone operator equations under a heuristic rule

    Ankit Singh

ETNA - Electronic Transactions on Numerical Analysis, pp. 207-225, 2026/06/18

doi: 10.1553/etna_vol65s207

doi: 10.1553/etna_vol65s207


PDF
X
BibTEX-Export:

X
EndNote/Zotero-Export:

X
RIS-Export:

X 
Researchgate-Export (COinS)

Permanent QR-Code

doi:10.1553/etna_vol65s207



doi:10.1553/etna_vol65s207

Abstract

In this paper, we propose a simplified iterative Lavrentiev regularization approach for computing stable approximate solutions of the nonlinear ill-posed operator equation $\mathcal{F}(x)=y$, where $\mathcal{F} : D(\mathcal{F})\subset X \rightarrow X$ is a nonlinear monotone operator defined on a Hilbert space $X$. For iterative regularization methods, the choice of a suitable stopping rule is a key issue since it strongly influences the stability and accuracy of the computed solution. In many practical situations, the exact level of noise present in the data is either unknown or unreliable, which makes classical a priori and a posteriori stopping rules difficult to apply. To address this difficulty, Q. Jin and W. Wang introduced in 2018 a heuristic stopping rule for the iteratively regularized Gauss–Newton method. Motivated by their work, we propose a heuristic selection rule for a simplified version of the Lavrentiev regularization method. The main advantage of the proposed scheme is that it requires the computation of the Fréchet derivative of the operator $\mathcal{F}$ only once, namely at an initial approximation $x_0$ of the exact solution $x^\dagger$. Under suitable assumptions that control the nonlinearity of the operator, we derive error estimates for the proposed method. Finally, we illustrate the practical behavior of the method by applying it to a nonlinear integral operator problem.

Keywords: Lavrentiev regularization, nonlinear ill-posed problems, heuristic parameter choice rules