An application of the Roberts' minimal degree algorithm to initial value problems

Abstract

Three algorithms are used to compute polynomial approximate solutions to initial value problems. One algorithm is based on the Roberts' minimal degree algorithm, whereas the other two algorithms utilize variants of the second algorithms of Remes. Our analysis indicates that the algorithm based on the Roberts' minimal degree algorithm is superior to the others considered.