Abstract
A lot of optimal solution techniques exist in literature and have been employed to solve optimization problems. However, in this work, two optimal solution techniques namely the Steepest Descent Method (SDM) and the Extended Conjugate Gradient Method (ECGM) were applied to two evolution equations to determine which best approximates the system to its analytic solution. Comparisons were also carried out between the SDM and the ECGM for optimal solution and convergence. In doing so, the Liberty Basic Programming Language (LBPL) was employed to perform various numerical iterations on the respective algorithms of the techniques. It was discovered that the SDM proved to be a better technique in obtaining an optimal solution than the ECGM.
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.
