In this article an inherently parallel algorithm to approximate the operator exponential is presented. The construction is based on the integral representation of the operator exponential and allows arbitrarily large time steps constituting a major advantage compared to classical schemes. The algorithm rests on the efficient solution of several elliptic problems depending on a complex parameter. We prove Besov regularity of the solutions to these elliptic problems. This result implies the efficiency of adaptive methods applied to the elliptic problems and leads to a complexity estimate for the complete algorithm. In the numerical experiments the efficiency of the new scheme is demonstrated by comparison to a single step method of second order.
Copyright 2006, Walter de Gruyter