Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
158 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Range-relaxed criteria for choosing the Lagrange multipliers in nonstationary iterated Tikhonov method (2011.05372v1)

Published 10 Nov 2020 in math.NA and cs.NA

Abstract: In this article we propose a novel nonstationary iterated Tikhonov (NIT) type method for obtaining stable approximate solutions to ill-posed operator equations modeled by linear operators acting between Hilbert spaces. Geometrical properties of the problem are used to derive a new strategy for choosing the sequence of regularization parameters (Lagrange multipliers) for the NIT iteration. Convergence analysis for this new method is provided. Numerical experiments are presented for two distinct applications: I) A 2D elliptic parameter identification problem (Inverse Potential Problem); II) An image deblurring problem. The results obtained validate the efficiency of our method compared with standard implementations of the NIT method (where a geometrical choice is typically used for the sequence of Lagrange multipliers).

Citations (13)

Summary

We haven't generated a summary for this paper yet.