Computable Error Bounds for Polynomial Collocation Methods

Abstract
Two types of “a posteriors” error bounds for the solution of two-point boundary value problems by polynomial collocation are compared. Both types are formulated so that they are applicable for a sufficient number of suitably distributed collocation points. Related estimates are also considered. The practical implementation of the theory is illustrated by numerical examples.