Abstract
A technique for finding the solution of discrete, multistate dynamic programming problems is applied to solve certain variational problems. The algorithm is a method of successive approximations using a general two-stage solution. The advantage of the method is that it provides a means of reducing Bellman's “curse of dimensionality.” An example on the Plateau problem or the minimal surface area problem is considered, and the algorithm is found to be computationally efficient.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.