A comparison of several invariant imbedding algorithms for the solution of two-point boundary-value problems

摘要

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.