*     ************************************************************************

      subroutine inelst(elst)

*     ************************************************************************

*     Purpose :
*     ---------

*     This routine initializes the status ELST of a considered
*     element function by considering the initial informations
*     stored in ELST by the user.

*     At the initialization phase of the algorithm, whe consider
*     that all the element functions are convex. The sith bit of
*     the integer ELST is set to one.

*     Parameter :
*     -----------

*     elst    ( int )

*       input  : derivatives informations on the considered
*                element function. It is given by the user.
*                - The absolute value of ELST corresponds to
*                  the technique the user wants to apply for
*                  updating the element Hessian matrix.
*                - ELST > 0 means that analytical gradient is
*                           available.
*                - ELST < 0 means that analytical gradient is
*                           not available.
*       output : the initial status of the element function.
*                - The first three bits are used to store
*                  the technique to use for updating the
*                  element Hessian matrix.
*                - The fourth bit is set to one if analytical
*                  gradient is available and is set to zero
*                  otherwise.
*                - The sith bit is set to one and the element
*                  function is considered as convex.

*     Routines used :
*     ---------------

*     None.

*     Programming :
*     -------------

*     D. Tuyttens

*     ========================================================================

*     Routine parameter

      integer elst

      if( elst.gt.0 ) then
        elst = elst      + 39
      else
        elst = abs(elst) + 31
      endif

      return
      end