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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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 call
