{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T10:45:58Z","timestamp":1756464358194,"version":"3.40.5"},"reference-count":20,"publisher":"Walter de Gruyter GmbH","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,1,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Information based complexity analysis in computing the solution of various practical problems is of great importance in recent years.\nThe amount of discrete information required to compute the solution plays an important role in the computational complexity of the problem.\nAlthough this approach has been applied successfully for linear problems, no effort has been made in literature to apply it to nonlinear problems.\nThis article addresses this problem by considering an efficient discretization scheme to discretize nonlinear ill-posed problems.\nWe apply the discretization scheme in the context of a simplified Gauss\u2013Newton iterative method and show that our scheme requires only less amount of information for computing the solution.\nThe convergence analysis and error estimates are derived.\nNumerical examples are provided to illustrate the fact that the scheme can be implemented successfully.\nThe theoretical and numerical study asserts that the scheme can be employed to nonlinear problems.<\/jats:p>","DOI":"10.1515\/cmam-2021-0146","type":"journal-article","created":{"date-parts":[[2023,6,14]],"date-time":"2023-06-14T09:21:09Z","timestamp":1686734469000},"page":"173-184","source":"Crossref","is-referenced-by-count":2,"title":["An Efficient Discretization Scheme for Solving Nonlinear Ill-Posed Problems"],"prefix":"10.1515","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2402-0164","authenticated-orcid":false,"given":"M.\u2009P.","family":"Rajan","sequence":"first","affiliation":[{"name":"School of Mathematics , Indian Institute of Science Education and Research Thiruvananthapuram , Vithura , Thiruvanathapuram - 695551, Kerala , India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaise","family":"Jose","sequence":"additional","affiliation":[{"name":"Department of Computer Science , Indian Institute of Information Technology , Valavoor , Kottayam - 686 635, Kerala , India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"374","published-online":{"date-parts":[[2023,6,15]]},"reference":[{"key":"2024010712054023262_j_cmam-2021-0146_ref_001","unstructured":"A. B. Bakushinski\u012d,\nOn a convergence problem of the iterative-regularized Gauss\u2013Newton method,\nComput. Math. Math. Phys. 32 (1992), 1353\u20131359."},{"key":"2024010712054023262_j_cmam-2021-0146_ref_002","doi-asserted-by":"crossref","unstructured":"A. Bakushinsky and A. Goncharsky,\nIll-Posed Problems: Theory and Applications,\nMath. Appl. 301,\nKluwer Academic, Dordrecht, 1994.","DOI":"10.1007\/978-94-011-1026-6"},{"key":"2024010712054023262_j_cmam-2021-0146_ref_003","doi-asserted-by":"crossref","unstructured":"B. Blaschke, A. Neubauer and O. Scherzer,\nOn convergence rates for the iteratively regularized Gauss\u2013Newton method,\nIMA J. Numer. Anal. 17 (1997), no. 3, 421\u2013436.","DOI":"10.1093\/imanum\/17.3.421"},{"key":"2024010712054023262_j_cmam-2021-0146_ref_004","doi-asserted-by":"crossref","unstructured":"M. Hanke,\nA regularizing Levenberg\u2013Marquardt scheme, with applications to inverse groundwater filtration problems,\nInverse Problems 13 (1997), no. 1, 79\u201395.","DOI":"10.1088\/0266-5611\/13\/1\/007"},{"key":"2024010712054023262_j_cmam-2021-0146_ref_005","doi-asserted-by":"crossref","unstructured":"N. S. Hoang and A. G. Ramm,\nDynamical systems method for solving nonlinear equations with monotone operators,\nMath. Comp. 79 (2010), no. 269, 239\u2013258.","DOI":"10.1090\/S0025-5718-09-02260-1"},{"key":"2024010712054023262_j_cmam-2021-0146_ref_006","doi-asserted-by":"crossref","unstructured":"J. Huang, X. Luo and R. Zhang,\nA simplified iteratively regularized projection method for nonlinear ill-posed problems,\nJ. Complexity 72 (2022), Paper No. 101664.","DOI":"10.1016\/j.jco.2022.101664"},{"key":"2024010712054023262_j_cmam-2021-0146_ref_007","doi-asserted-by":"crossref","unstructured":"Q. Jin,\nOn a class of frozen regularized Gauss\u2013Newton methods for nonlinear inverse problems,\nMath. Comp. 79 (2010), no. 272, 2191\u20132211.","DOI":"10.1090\/S0025-5718-10-02359-8"},{"key":"2024010712054023262_j_cmam-2021-0146_ref_008","doi-asserted-by":"crossref","unstructured":"Q.-N. Jin,\nOn the iteratively regularized Gauss\u2013Newton method for solving nonlinear ill-posed problems,\nMath. Comp. 69 (2000), no. 232, 1603\u20131623.","DOI":"10.1090\/S0025-5718-00-01199-6"},{"key":"2024010712054023262_j_cmam-2021-0146_ref_009","doi-asserted-by":"crossref","unstructured":"J. Jose and M. P. Rajan,\nA simplified Landweber iteration for solving nonlinear ill-posed problems,\nInt. J. Appl. Comput. Math. 3 (2017), S1001\u2013S1018.","DOI":"10.1007\/s40819-017-0395-4"},{"key":"2024010712054023262_j_cmam-2021-0146_ref_010","doi-asserted-by":"crossref","unstructured":"B. Kaltenbacher,\nSome Newton-type methods for the regularization of nonlinear ill-posed problems,\nInverse Problems 13 (1997), no. 3, 729\u2013753.","DOI":"10.1088\/0266-5611\/13\/3\/012"},{"key":"2024010712054023262_j_cmam-2021-0146_ref_011","doi-asserted-by":"crossref","unstructured":"B. Kaltenbacher,\nA posteriori parameter choice strategies for some Newton type methods for the regularization of nonlinear ill-posed problems,\nNumer. Math. 79 (1998), no. 4, 501\u2013528.","DOI":"10.1007\/s002110050349"},{"key":"2024010712054023262_j_cmam-2021-0146_ref_012","doi-asserted-by":"crossref","unstructured":"P. Maa\u00df, S. V. Pereverzev, R. Ramlau and S. G.Solodky,\nAn adaptive discretization for Tikhonov\u2013Phillips regularization with a posteriori parameter selection,\nNumer. Math. 87 (2001), no. 3, 485\u2013502.","DOI":"10.1007\/PL00005421"},{"key":"2024010712054023262_j_cmam-2021-0146_ref_013","doi-asserted-by":"crossref","unstructured":"P. Mahale and M. T. Nair,\nA simplified generalized Gauss-Newton method for nonlinear ill-posed problems,\nMath. Comp. 78 (2009), no. 265, 171\u2013184.","DOI":"10.1090\/S0025-5718-08-02149-2"},{"key":"2024010712054023262_j_cmam-2021-0146_ref_014","doi-asserted-by":"crossref","unstructured":"A. Neubauer and O. Scherzer,\nFinite-dimensional approximation of Tikhonov regularized solutions of nonlinear ill-posed problems,\nNumer. Funct. Anal. Optim. 11 (1990), no. 1\u20132, 85\u201399.","DOI":"10.1080\/01630569008816362"},{"key":"2024010712054023262_j_cmam-2021-0146_ref_015","doi-asserted-by":"crossref","unstructured":"S. V. Pereverzev,\nOptimization of projection methods for solving ill-posed problems,\nComputing 55 (1995), no. 2, 113\u2013124.","DOI":"10.1007\/BF02238096"},{"key":"2024010712054023262_j_cmam-2021-0146_ref_016","doi-asserted-by":"crossref","unstructured":"S. V. Pereverzev and S. G. Solodki\u012d,\nOptimal discretization of ill-posed problems,\nUkrainian Math. J. 52 (2000), no. 1, 115\u2013132.","DOI":"10.1007\/BF02514141"},{"key":"2024010712054023262_j_cmam-2021-0146_ref_017","doi-asserted-by":"crossref","unstructured":"D. Pradeep and M. P. Rajan,\nA simplified Gauss\u2013Newton iterative scheme with an a posteriori parameter choice rule for solving nonlinear ill-posed problems,\nInt. J. Appl. Comput. Math. 2 (2016), no. 1, 97\u2013112.","DOI":"10.1007\/s40819-015-0050-x"},{"key":"2024010712054023262_j_cmam-2021-0146_ref_018","doi-asserted-by":"crossref","unstructured":"M. P. Rajan,\nAn efficient discretization scheme for solving ill-posed problems,\nJ. Math. Anal. Appl. 313 (2006), no. 2, 654\u2013677.","DOI":"10.1016\/j.jmaa.2005.06.009"},{"key":"2024010712054023262_j_cmam-2021-0146_ref_019","doi-asserted-by":"crossref","unstructured":"M. P. Rajan,\nA posteriori parameter choice with an efficient discretization scheme for solving ill-posed problems,\nAppl. Math. Comput. 204 (2008), no. 2, 891\u2013904.","DOI":"10.1016\/j.amc.2008.07.036"},{"key":"2024010712054023262_j_cmam-2021-0146_ref_020","doi-asserted-by":"crossref","unstructured":"E. V. Semenova,\nLavrentiev regularization and balancing principle for solving ill-posed problems with monotone operators,\nComput. Methods Appl. Math. 10 (2010), no. 4, 444\u2013454.","DOI":"10.2478\/cmam-2010-0026"}],"container-title":["Computational Methods in Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/cmam-2021-0146\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/cmam-2021-0146\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,7]],"date-time":"2024-01-07T12:06:23Z","timestamp":1704629183000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/cmam-2021-0146\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,15]]},"references-count":20,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,5,23]]},"published-print":{"date-parts":[[2024,1,1]]}},"alternative-id":["10.1515\/cmam-2021-0146"],"URL":"https:\/\/doi.org\/10.1515\/cmam-2021-0146","relation":{},"ISSN":["1609-4840","1609-9389"],"issn-type":[{"type":"print","value":"1609-4840"},{"type":"electronic","value":"1609-9389"}],"subject":[],"published":{"date-parts":[[2023,6,15]]}}}