2018
DOI: 10.1515/cmam-2018-0019
|View full text |Cite
|
Sign up to set email alerts
|

Derivative Free Regularization Method for Nonlinear Ill-Posed Equations in Hilbert Scales

Abstract: In this paper, we deal with nonlinear ill-posed operator equations involving a monotone operator in the setting of Hilbert scales. Our convergence analysis of the proposed derivative-free method is based on the simple property of the norm of a self-adjoint operator. Using a general Hölder-type source condition, we obtain an optimal order error estimate. Also we consider the adaptive parameter choice strategy proposed by Pereverzev and Schock (2005) for choosing the regularization parameter. Finally, we applied… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
0
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(5 citation statements)
references
References 27 publications
0
0
0
Order By: Relevance
“…Finally, we conclude that our research contributes to the development of more efficient and robust numerical methods for solving nonlinear equations in a variety of scientific and engineering applications. Similar methodology is applicable to other methods [2,[8][9][10][11][12][13][14]. Thus, this can be the chosen course of action for upcoming projects.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…Finally, we conclude that our research contributes to the development of more efficient and robust numerical methods for solving nonlinear equations in a variety of scientific and engineering applications. Similar methodology is applicable to other methods [2,[8][9][10][11][12][13][14]. Thus, this can be the chosen course of action for upcoming projects.…”
Section: Discussionmentioning
confidence: 99%
“…The accurate computation of the radius of convergence is essential for optimizing the performance and reliability of iterative solvers in practical applications. Further, the computable upper error bounds on ∥y (j) n − x * ∥ and results on the uniqueness of x * were not considered in a previous study [7] or in similar methods using Taylor series to determine the order of convergence [2,[8][9][10][11][12][13][14].…”
Section: Introductionmentioning
confidence: 99%
“…In numerical analysis, higher order iterative methods have acquired foremost significance for solving nonlinear equations that arise in numerous branches of science and technology [1,2]. Various researchers have developed a plethora of iterative methods [3][4][5][6][7][8][9][10][11][12][13] for solving nonlinear equations given in the form ( ) 0, f x = where f : D ⊂ R → R is a continuously differentiable nonlinear function and D is an open interval. Most widely used iterative method is quadratically convergent Newton's method given by 1 ( ) , 0,1, 2, .…”
Section: Introductionmentioning
confidence: 99%
“…Numerous studies exist in the local as well as the semi-local convergence analysis of iterative schemes [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16]. Recently, there has been a surge in the development of schemes for solving equations or systems of equations involving nondifferentiable operators.…”
mentioning
confidence: 99%
“…A finer and more flexible local and semi-local convergence analysis for the scheme (1.2) is developed involving an invertible operator P , which if chosen appropriately leads to weaker convergence conditions, better uniqueness of the solution and a larger radius of convergence than if P is chosen to be as in earlier studies F (x * ) or F (x 0 ) or [x 0 , x −1 ; F ]. This idea can be extended to multistep and multipoint schemes [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16]. This is the direction of our future research.…”
mentioning
confidence: 99%