Abstract
A comparison of several invariant imbedding algorithms for the numerical solution of two-point boundary-value problems is presented. These include the Scott algorithm, the Kagiwada-Kalaba algorithm, the addition formulas, and the sweep method. Advantages and disadvantages of each algorithm are discussed, and numerical examples are presented.
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.
