Information based complexity analysis in computing the solution of various practical problems is of great importance in recent years.
The amount of discrete information required to compute the solution plays an important role in the computational complexity of the problem.
Although this approach has been applied successfully for linear problems, no effort has been made in literature to apply it to nonlinear problems.
This article addresses this problem by considering an efficient discretization scheme to discretize nonlinear ill-posed problems.
We apply the discretization scheme in the context of a simplified Gauss–Newton iterative method and show that our scheme requires only less amount of information for computing the solution.
The convergence analysis and error estimates are derived.
Numerical examples are provided to illustrate the fact that the scheme can be implemented successfully.
The theoretical and numerical study asserts that the scheme can be employed to nonlinear problems.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.