Abstract
In this paper we present a variational approximation method for solving Troesch’s problem. The existence and the uniqueness of this problem are shown. Moreover, we construct a sequence of approximate solutions of the problem from the number of knots of a partition of the domain. Such sequence converges to the exact solution of the problem. Finally, we analyze some graphical and numerical examples in order to show the efficiency of our method.
Sign-in/Register to access full text options 
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.
