The performances of the code TOM on the Holt problem

The code TOM, for the solution of boundary value problems, is based on linear multistep methods used as BVMs. Among the peculiar features of this code, the mesh selection strategy, based on two measures of conditioning of the problem, seems the most interesting. In this paper the application of the code to the classical Holt problem, one of the most famous and difficult BVP, will permit to stress the effectiveness of such approach along with the utility of the additional information provided by the two measures.