The error bound of a numerical algorithm is very crucial to it’s selection for use in computatio of numerical values of Initial Value Problems. In this work, we investigate and compute the error bounds for the new Euler scheme proposed by Abraham in [1]. We compare and contrast this same parameter for the existing Euler Methods and the new proposed method. AMS MSC 2010 Classification: 65L05, 65L06
