Abstract
Solving a nonlinear equation in a functional space requires two processes: discretization and linearization. In recent paper Grammant et al. (J Integral Equ Appl 26:413–436, 2014), the authors study the difference between applying them in one and in the other order. Linearizing first the nonlinear problem and discretizing the linear problem will be called option (B). Discretizing first the nonlinear problem and linearizing the discrete nonlinear problem will be called option (C). In this paper, we propose a new numerical process equivalent to the option (B): we linearize first the original nonlinear problem with an alternative linearization scheme than that used in the option (B), then we discretize the resulting iterative linear equations using a projection method to implement the corresponding finite-dimensional problem. The aims of this new process are intended to get weaker the theoretical assumptions and to give a powerful numerical performance. We give sufficient conditions to deal with the convergence results. Finally, as a numerical application, we solve a system of Fredholm equations of the second kind. The accuracy and efficiency of this process are illustrated in some numerical examples.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
