![](/jspui/image/dspace_header.jpg)
Please use this identifier to cite or link to this item:
https://idr.nitk.ac.in/jspui/handle/123456789/11118
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Argyros, I.K. | |
dc.contributor.author | Cho, Y.J. | |
dc.contributor.author | George, S. | |
dc.date.accessioned | 2020-03-31T08:30:49Z | - |
dc.date.available | 2020-03-31T08:30:49Z | - |
dc.date.issued | 2013 | |
dc.identifier.citation | Boundary Value Problems, 2013, Vol.2013, , pp.- | en_US |
dc.identifier.uri | http://idr.nitk.ac.in/jspui/handle/123456789/11118 | - |
dc.description.abstract | In this paper, we are concerned with the problem of approximating a solution of an ill-posed problem in a Hilbert space setting using the Lavrentiev regularization method and, in particular, expanding the applicability of this method by weakening the popular Lipschitz-type hypotheses considered in earlier studies such as (Bakushinskii and Smirnova in Numer. Funct. Anal. Optim. 26:35-48, 2005; Bakushinskii and Smirnova in Nonlinear Anal. 64:1255-1261, 2006; Bakushinskii and Smirnova in Numer. Funct. Anal. Optim. 28:13-25, 2007; Jin in Math. Comput. 69:1603-1623, 2000; Mahale and Nair in ANZIAM J. 51:191-217, 2009). Numerical examples are given to show that our convergence criteria are weaker and our error analysis tighter under less computational cost than the corresponding works given in (Bakushinskii and Smirnova in Numer. Funct. Anal. Optim. 26:35-48, 2005; Bakushinskii and Smirnova in Nonlinear Anal. 64:1255-1261, 2006; Bakushinskii and Smirnova in Numer. Funct. Anal. Optim. 28:13-25, 2007; Jin in Math. Comput. 69:1603-1623, 2000; Mahale and Nair in ANZIAM J. 51:191-217, 2009). 2013 Argyros et al.; licensee Springer. | en_US |
dc.title | Expanding the applicability of Lavrentiev regularization methods for ill-posed problems | en_US |
dc.type | Article | en_US |
Appears in Collections: | 1. Journal Articles |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.