scholarly journals On fractional asymptotical regularization of linear ill-posed problems in hilbert spaces

2019 ◽  
Vol 22 (3) ◽  
pp. 699-721 ◽  
Author(s):  
Ye Zhang ◽  
Bernd Hofmann
Keyword(s):  
Fractional Order ◽  
Hilbert Spaces ◽  
Regularization Method ◽  
Numerical Realization ◽  
Regularization Methods ◽  
Iterative Regularization ◽  
Operator Equations ◽  
Ill Posed ◽  
One Step ◽  
The One

Abstract In this paper, we study a fractional-order variant of the asymptotical regularization method, called Fractional Asymptotical Regularization (FAR), for solving linear ill-posed operator equations in a Hilbert space setting. We assign the method to the general linear regularization schema and prove that under certain smoothness assumptions, FAR with fractional order in the range (1, 2) yields an acceleration with respect to comparable order optimal regularization methods. Based on the one-step Adams-Moulton method, a novel iterative regularization scheme is developed for the numerical realization of FAR. Two numerical examples are given to show the accuracy and the acceleration effect of FAR.

Accuracy estimates of Gauss–Newton-type iterative regularization methods for nonlinear equations with operators having normally solvable derivative at the solution

2016 ◽  
Vol 24 (4) ◽  
Author(s):  
Mikhail Y. Kokurin
Keyword(s):  
Hilbert Spaces ◽  
Total Error ◽  
A Priori ◽  
Stopping Rules ◽  
Regularization Methods ◽  
Iterative Regularization ◽  
Operator Equations ◽  
Ill Posed ◽  
Irregular Operator ◽  
The Right

AbstractWe investigate a class of iterative regularization methods for solving nonlinear irregular operator equations in Hilbert spaces. The operator of an equation is supposed to have a normally solvable derivative at the desired solution. The operators and right parts of equations can be given with errors. A priori and a posteriori stopping rules for the iterations are analyzed. We prove that the accuracy of delivered approximations is proportional to the total error level in the operator and the right part of an equation. The obtained results improve known accuracy estimates for the class of iterative regularization methods, as applied to general irregular operator equations. The results also extend previous similar estimates related to regularization methods for linear ill-posed equations with normally solvable operators.

scholarly journals An iterative regularization method for variational inequalities in Hilbert spaces

2020 ◽  
Vol 36 (3) ◽  
pp. 475-482
Author(s):  
HONG-KUN XU ◽  
NAJLA ALTWAIJRY ◽  
SOUHAIL CHEBBI
Keyword(s):  
Hilbert Space ◽  
Variational Inequality ◽  
Hilbert Spaces ◽  
Regularization Method ◽  
Iterative Solution ◽  
Iterative Regularization ◽  
Lipschitz Continuous ◽  
Ill Posed ◽  
Feasible Solutions ◽  
First Time

We consider an iterative method for regularization of a variational inequality (VI) defined by a Lipschitz continuous monotone operator in the case where the set of feasible solutions is decomposed to the intersection of finitely many closed convex subsets of a Hilbert space. We prove the strong convergence of the sequence generated by our algorithm. It seems that this is the first time in the literature to handle iterative solution of ill-posed VIs in the domain decomposition case.

A Variant of Projection-Regularization Method for Ill-Posed Linear Operator Equations

2020 ◽  
pp. 2150008
Author(s):  
Bechouat Tahar ◽  
Boussetila Nadjib ◽  
Rebbani Faouzia
Keyword(s):  
Approximate Solution ◽  
Linear Operator ◽  
Tikhonov Regularization ◽  
Hilbert Spaces ◽  
Regularization Method ◽  
Tikhonov Regularization Method ◽  
Operator Equations ◽  
Ill Posed ◽  
Rank Approximation ◽  
Linear Operator Equations

In this paper, we report on a strategy for computing the numerical approximate solution for a class of ill-posed operator equations in Hilbert spaces: [Formula: see text]. This approach is a combination of Tikhonov regularization method and the finite rank approximation of [Formula: see text]. Finally, numerical results are given to show the effectiveness of this method.

scholarly journals Heating source localization in a reduced time

2016 ◽  
Vol 26 (3) ◽  
pp. 623-640 ◽  
Author(s):  
Sara Beddiaf ◽  
Laurent Autrique ◽  
Laetitia Perez ◽  
Jean-Claude Jolly
Keyword(s):  
Heat Conduction ◽  
Source Localization ◽  
Conjugate Gradient ◽  
Regularization Method ◽  
Three Dimensional ◽  
Gradient Algorithm ◽  
Iterative Regularization ◽  
Heating Source ◽  
Ill Posed ◽  
Reduced Time

Abstract Inverse three-dimensional heat conduction problems devoted to heating source localization are ill posed. Identification can be performed using an iterative regularization method based on the conjugate gradient algorithm. Such a method is usually implemented off-line, taking into account observations (temperature measurements, for example). However, in a practical context, if the source has to be located as fast as possible (e.g., for diagnosis), the observation horizon has to be reduced. To this end, several configurations are detailed and effects of noisy observations are investigated.

Iterative Regularization Methods for Nonlinear Ill-Posed Problems

2008 ◽  
Author(s):  
Barbara Kaltenbacher ◽  
Andreas Neubauer ◽  
Otmar Scherzer
Keyword(s):  
Regularization Methods ◽  
Iterative Regularization ◽  
Ill Posed

scholarly journals A LEPSKIJ-TYPE STOPPING-RULE FOR SIMPLIFIED ITERATIVELY REGULARIZED GAUSS-NEWTON METHOD

2017 ◽  
Author(s):  
Agah D. Garnadi
Keyword(s):  
Newton Method ◽  
Hilbert Spaces ◽  
Potential Problem ◽  
Initial Approximation ◽  
Stopping Rule ◽  
A Posteriori ◽  
Iterative Regularization ◽  
Ill Posed ◽  
Derivatives Of ◽  
Unknown Solution

Iterative regularization methods for nonlinear ill-posed equations of the form $ F(a)= y$, where $ F: D(F) \subset X \to Y$ is an operator between Hilbert spaces $ X $ and $ Y$, usually involve calculation of the Fr\'{e}chet derivatives of $ F$ at each iterate and at the unknown solution $ a^\sharp$. A modified form of the generalized Gauss-Newton method which requires the Fr\'{e}chet derivative of $F$ only at an initial approximation $ a_0$ of the solution $ a^\sharp$ as studied by Mahale and Nair \cite{MaNa:2k9}. This work studied an {\it a posteriori} stopping rule of Lepskij-type of the method. A numerical experiment from inverse source potential problem is demonstrated.

Sign in / Sign up

Export Citation Format

Share Document