The paper considers some error estimates of a collocation-Galerkin method for two point boundary value problems. It is shown that the errors at certain Jacobi points are O(h**r** plus **2), where h is the maximal size of the partitioned intervals and r is the degree of used polynomials, which is one order higher than the global optimal error. A numerical example which confirms these results is presented.