The explicit sixth‐order Numerov‐type family of methods is considered. A new representative from this family is produced and equipped with a cheap step‐size changing algorithm. Actually, after the completion of… Click to show full abstract
The explicit sixth‐order Numerov‐type family of methods is considered. A new representative from this family is produced and equipped with a cheap step‐size changing algorithm. Actually, after the completion of a step, this remains the same, halved, or doubled. The off‐step points required for such technique are evaluated through local interpolant. Numerical tests over various problems illustrate the efficiency gained by this approach.
               
Click one of the above tabs to view related content.