Efficient computation of the Airy propagators

We construct a new set of formulae for the Airy propagators whose computation is by one order of magnitude faster than that based on the Airy functions, with the additional advantage of producing results which are free of accuracy loss. The new set can be successfully applied, among others, for improving the performance of the codes which use the method of Gordon for the solution of the Schrödinger equation.