Convergence rate results for steepest descent type method for nonlinear ill-posed equations

dc.contributor.authorGeorge, S.
dc.contributor.authorSabari, M.
dc.date.accessioned2026-02-05T09:32:33Z
dc.date.issued2017
dc.description.abstractConvergence rate result for a modified steepest descent method and a modified minimal error method for the solution of nonlinear ill-posed operator equation have been proved with noisy data. To our knowledge, convergence rate result for the steepest descent method and minimal error method with noisy data are not known. We provide a convergence rate results for these methods with noisy data. The result in this paper are obtained under less computational cost when compared to the steepest descent method and minimal error method. We present an academic example which satisfies the assumptions of this paper. © 2016 Elsevier Inc.
dc.identifier.citationApplied Mathematics and Computation, 2017, 294, , pp. 169-179
dc.identifier.issn963003
dc.identifier.urihttps://doi.org/10.1016/j.amc.2016.09.009
dc.identifier.urihttps://idr.nitk.ac.in/handle/123456789/25702
dc.publisherElsevier Inc. usjcs@elsevier.com
dc.subjectErrors
dc.subjectMathematical operators
dc.subjectNonlinear equations
dc.subjectComputational costs
dc.subjectConvergence rates
dc.subjectDiscrepancy principle
dc.subjectIll-posed operator equation
dc.subjectMinimal errors
dc.subjectNonlinear ill-posed equations
dc.subjectNonlinear ill-posed problems
dc.subjectRegularization methods
dc.subjectSteepest descent method
dc.titleConvergence rate results for steepest descent type method for nonlinear ill-posed equations

Files

Collections