scholarly journals Inverse Free Iterative Methods for Nonlinear Ill-Posed Operator Equations

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Ioannis K. Argyros ◽  
Santhosh George ◽  
P. Jidesh
Keyword(s):  
Approximate Solution ◽  
Regularization Parameter ◽  
Optimal Order ◽  
Operator Equations ◽  
Source Condition ◽  
Numerical Examples ◽  
Ill Posed ◽  
Balancing Principle ◽  
General Source ◽  
New Iterative Method

We present a new iterative method which does not involve inversion of the operators for obtaining an approximate solution for the nonlinear ill-posed operator equationF(x)=y. The proposed method is a modified form of Tikhonov gradient (TIGRA) method considered by Ramlau (2003). The regularization parameter is chosen according to the balancing principle considered by Pereverzev and Schock (2005). The error estimate is derived under a general source condition and is of optimal order. Some numerical examples involving integral equations are also given in this paper.

scholarly journals Newton Type Iteration for Tikhonov Regularization of Nonlinear Ill-Posed Problems in Hilbert Scales

2014 ◽  
Vol 2014 ◽  
pp. 1-9
Author(s):  
Monnanda Erappa Shobha ◽  
Santhosh George
Keyword(s):  
Integral Equation ◽  
Iterative Method ◽  
Iterative Scheme ◽  
Initial Guess ◽  
Optimal Order ◽  
Source Condition ◽  
Adaptive Scheme ◽  
Actual Solution ◽  
Ill Posed ◽  
General Source

Recently, Vasin and George (2013) considered an iterative scheme for approximately solving an ill-posed operator equationF(x)=y. In order to improve the error estimate available by Vasin and George (2013), in the present paper we extend the iterative method considered by Vasin and George (2013), in the setting of Hilbert scales. The error estimates obtained under a general source condition onx0-x^(x0is the initial guess andx^is the actual solution), using the adaptive scheme proposed by Pereverzev and Schock (2005), are of optimal order. The algorithm is applied to numerical solution of an integral equation in Numerical Example section.

scholarly journals Two-Step Modified Newton Method for Nonlinear Lavrentiev Regularization

2012 ◽  
Vol 2012 ◽  
pp. 1-14 ◽  
Author(s):  
Santhosh George ◽  
Suresan Pareth
Keyword(s):  
Newton Method ◽  
Regularization Parameter ◽  
Adaptive Method ◽  
Initial Guess ◽  
Optimal Order ◽  
Lavrentiev Regularization ◽  
Modified Newton Method ◽  
Actual Solution ◽  
Ill Posed ◽  
General Source

A two step modified Newton method is considered for obtaining an approximate solution for the nonlinear ill-posed equation F(x)=f when the available data are fδ with ‖f−fδ‖≤δ and the operator F is monotone. The derived error estimate under a general source condition on x0−x^ is of optimal order; here x0 is the initial guess and x^ is the actual solution. The regularization parameter is chosen according to the adaptive method considered by Perverzev and Schock (2005). The computational results provided endorse the reliability and effectiveness of our method.

scholarly journals An optimal order yielding discrepancy principle for simplified regularization of ill-posed problems in Hilbert scales

2003 ◽  
Vol 2003 (39) ◽  
pp. 2487-2499 ◽  
Author(s):  
Santhosh George ◽  
M. Thamban Nair
Keyword(s):  
Approximate Solution ◽  
Hilbert Spaces ◽  
Regularization Parameter ◽  
Optimal Order ◽  
Discrepancy Principle ◽  
Parameter Choice ◽  
Bounded Linear ◽  
Choice Strategy ◽  
Ill Posed ◽  
Parameter Choice Strategy

Recently, Tautenhahn and Hämarik (1999) have considered a monotone rule as a parameter choice strategy for choosing the regularization parameter while considering approximate solution of an ill-posed operator equationTx=y, whereTis a bounded linear operator between Hilbert spaces. Motivated by this, we propose a new discrepancy principle for the simplified regularization, in the setting of Hilbert scales, whenTis a positive and selfadjoint operator. When the datayis known only approximately, our method provides optimal order under certain natural assumptions on the ill-posedness of the equation and smoothness of the solution. The result, in fact, improves an earlier work of the authors (1997).

A Quadratic Convergence Yielding Iterative Method for Nonlinear Ill-posed Operator Equations

2012 ◽  
Vol 12 (1) ◽  
pp. 32-45 ◽  
Author(s):  
Santhosh George ◽  
Atef Ibrahim Elmahdy
Keyword(s):  
Iterative Method ◽  
Operator Equation ◽  
Quadratic Convergence ◽  
Regularization Parameter ◽  
Optimal Order ◽  
Majorizing Sequence ◽  
Operator Equations ◽  
Order Error ◽  
Ill Posed ◽  
The Given

AbstractIn this paper, we consider an iterative method for the approximate solution of the nonlinear ill-posed operator equation Tx = y. The iteration procedure converges quadratically to the unique solution of the equation for the regularized approximation. It is known that (Tautanhahn (2002)) this solution converges to the solution of the given ill-posed operator equation. The convergence analysis and the stopping rule are based on a suitably constructed majorizing sequence. We show that the adaptive scheme considered by Perverzev and Schock (2005) for choosing the regularization parameter can be effectively used here for obtaining an optimal order error estimate.

Simplified Iteratively Regularized Gauss–Newton Method in Banach Spaces Under a General Source Condition

2020 ◽  
Vol 20 (2) ◽  
pp. 321-341
Author(s):  
Pallavi Mahale ◽  
Sharad Kumar Dixit
Keyword(s):  
Newton Method ◽  
Regularization Parameter ◽  
A Priori ◽  
Identification Problem ◽  
Stopping Rule ◽  
Optimal Error Estimates ◽  
Source Condition ◽  
Parameter Identification Problem ◽  
Ill Posed ◽  
General Source

AbstractIn this paper, we consider a simplified iteratively regularized Gauss–Newton method in a Banach space setting under a general source condition. We will obtain order-optimal error estimates both for an a priori stopping rule and for a Morozov-type stopping rule together with a posteriori choice of the regularization parameter. An advantage of a general source condition is that it provides a unified setting for the error analysis which can be applied to the cases of both severely and mildly ill-posed problems. We will give a numerical example of a parameter identification problem to discuss the performance of the method.

scholarly journals Newton-Type Iteration for Tikhonov Regularization of Nonlinear Ill-Posed Problems

2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Santhosh George
Keyword(s):  
Newton Method ◽  
Hilbert Spaces ◽  
Nonlinear Integral Equation ◽  
Nonlinear Operator ◽  
Regularization Parameter ◽  
Adaptive Method ◽  
Majorizing Sequence ◽  
Source Condition ◽  
Ill Posed ◽  
General Source

Recently in the work of George, 2010, we considered a modified Gauss-Newton method for approximate solution of a nonlinear ill-posed operator equationF(x)=y, whereF:D(F)⊆X→Yis a nonlinear operator between the Hilbert spacesXandY. The analysis in George, 2010 was carried out using a majorizing sequence. In this paper, we consider also the modified Gauss-Newton method, but the convergence analysis and the error estimate are obtained by analyzing the odd and even terms of the sequence separately. We use the adaptive method in the work of Pereverzev and Schock, 2005 for choosing the regularization parameter. The optimality of this method is proved under a general source condition. A numerical example of nonlinear integral equation shows the performance of this procedure.

scholarly journals EXTRAPOLATION OF TIKHONOV REGULARIZATION METHOD

2010 ◽  
Vol 15 (1) ◽  
pp. 55-68 ◽  
Author(s):  
Uno Hämarik ◽  
Reimo Palm ◽  
Toomas Raus
Keyword(s):  
Approximate Solution ◽  
Tikhonov Regularization ◽  
Noise Level ◽  
Regularization Method ◽  
Regularization Parameter ◽  
Noisy Data ◽  
Tikhonov Regularization Method ◽  
Guaranteed Accuracy ◽  
Numerical Examples ◽  
Ill Posed

We consider regularization of linear ill‐posed problem Au = f with noisy data fδ, ¦fδ - f¦≤ δ . The approximate solution is computed as the extrapolated Tikhonov approximation, which is a linear combination of n ≥ 2 Tikhonov approximations with different parameters. If the solution u* belongs to R((A*A) n ), then the maximal guaranteed accuracy of Tikhonov approximation is O(δ 2/3) versus accuracy O(δ 2n/(2n+1)) of corresponding extrapolated approximation. We propose several rules for choice of the regularization parameter, some of these are also good in case of moderate over‐ and underestimation of the noise level. Numerical examples are given.

scholarly journals Morozov’s Discrepancy Principle For The Tikhonov Regularization Of Exponentially Ill-Posed Problems

2008 ◽  
Vol 8 (1) ◽  
pp. 86-98 ◽  
Author(s):  
S.G. SOLODKY ◽  
A. MOSENTSOVA
Keyword(s):  
Tikhonov Regularization ◽  
Optimal Order ◽  
Discrepancy Principle ◽  
Operator Equations ◽  
Order Of Accuracy ◽  
Finite Dimensional ◽  
Dimensional Version ◽  
Ill Posed ◽  
Linear Operator Equations ◽  
Morozov’S Discrepancy Principle

Abstract The problem of approximate solution of severely ill-posed problems given in the form of linear operator equations of the first kind with approximately known right-hand sides was considered. We have studied a strategy for solving this type of problems, which consists in combinating of Morozov’s discrepancy principle and a finite-dimensional version of the Tikhonov regularization. It is shown that this combination provides an optimal order of accuracy on source sets

scholarly journals Convergence Rate of the Modified Landweber Method for Solving Inverse Potential Problems

Mathematics ◽  
2020 ◽  
Vol 8 (4) ◽  
pp. 608
Author(s):  
Pornsarp Pornsawad ◽  
Parada Sungcharoen ◽  
Christine Böckmann
Keyword(s):  
Convergence Rate ◽  
Potential Problem ◽  
Regularization Parameter ◽  
Discrepancy Principle ◽  
Source Condition ◽  
Rate Analysis ◽  
Potential Problems ◽  
Ill Posed ◽  
Landweber Method ◽  
Convergence Rate Analysis

In this paper, we present the convergence rate analysis of the modified Landweber method under logarithmic source condition for nonlinear ill-posed problems. The regularization parameter is chosen according to the discrepancy principle. The reconstructions of the shape of an unknown domain for an inverse potential problem by using the modified Landweber method are exhibited.

scholarly journals The Impact of the Discrepancy Principle on the Tikhonov-Regularized Solutions with Oversmoothing Penalties

Mathematics ◽  
2020 ◽  
Vol 8 (3) ◽  
pp. 331
Author(s):  
Bernd Hofmann ◽  
Christopher Hofmann
Keyword(s):  
Case Studies ◽  
Convergence Rates ◽  
Regularization Parameter ◽  
A Priori ◽  
Discrepancy Principle ◽  
Parameter Choice ◽  
Operator Equations ◽  
Analytical Results ◽  
Ill Posed ◽  
The Impact

This paper deals with the Tikhonov regularization for nonlinear ill-posed operator equations in Hilbert scales with oversmoothing penalties. One focus is on the application of the discrepancy principle for choosing the regularization parameter and its consequences. Numerical case studies are performed in order to complement analytical results concerning the oversmoothing situation. For example, case studies are presented for exact solutions of Hölder type smoothness with a low Hölder exponent. Moreover, the regularization parameter choice using the discrepancy principle, for which rate results are proven in the oversmoothing case in in reference (Hofmann, B.; Mathé, P. Inverse Probl. 2018, 34, 015007) is compared to Hölder type a priori choices. On the other hand, well-known analytical results on the existence and convergence of regularized solutions are summarized and partially augmented. In particular, a sketch for a novel proof to derive Hölder convergence rates in the case of oversmoothing penalties is given, extending ideas from in reference (Hofmann, B.; Plato, R. ETNA. 2020, 93).

Sign in / Sign up

Export Citation Format

Share Document