Abstract
In the optimization of a non-linear system one is generally faced with a complicated two point boundary value problem. This two point boundary value problem in the case of a linear system can be solved by breaking it into two one point boundary value problems, by going into the Riccati equation. However in case of a non-linear or bilinear system the solution of the Riccati equation is not a simple undertaking. Thus various iteration methods are often tried. In this paper a method of solving this two point boundary value problem on analog computer has been presented. The steepest descent method is applied here on boundary condition iteration. This method overcomes a past hesitation of using the analog computer for the optimization problems, which require a large computer memory. This method in fact is applicable to any system linear or non-linear. However the size of the computer and the degree of accuracy definitely limit its application.
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.
