1. Introduction. In [Z], Zagier describes several methods for explicitly computing (large) integral points on models of elliptic curves defined over Q. Here we are interested in the computation of all integral points on a given Weierstraß equation for an elliptic curve E/Q, but not merely by reducing the original diophantine equation to an equivalent finite set of Thue equations which are subsequently solved by elementary, algebraic or analytic methods (see [TdW] and [STz]). On the contrary, we adopt a more natural approach, one in which the linear (group) relation between an integral point and the generators of the free component of the Mordell-Weil group is directly transformed into a linear form in elliptic logarithms. This idea is not new; see [Ma, App. IV], [La, Ch. VI, §8], and [S1, Ch. IX, §5]. To make it work, that is to say, in order to produce upper bounds for the coefficients in the original linear (group) relation, one needs an effective lower bound for the linear form in elliptic logarithms. First to obtain such lower bounds were D. W. Masser [Ma, App. IV], in the case of elliptic curves with complex multiplication, and G. Wüstholz [Wu]; see also the bibliography in [H]. We felt that the recent result of N. Hirata-Kohno [H, Coroll. 2.16] should serve our purpose best. Unfortunately, this result, being rather more general than we required, though effective, is not completely explicit. At our request, S. David kindly undertook the highly non-trivial task of making explicit the special case we needed. It is S. David's result [D, Th. 2.1] that is applied here for the first time to provide explicit upper bounds for the coefficients in the linear (group) relation corresponding to a given Weierstraß equation. We shall show by example that these bounds may be reduced to manageable proportions.In the following sections we shall give a detailed description of the method referred to above. In the final section we present two examples, worked out in detail, of elliptic curves taken from the literature. Our choice
