ACCELERATION OF THE FRAME ALGORITHM

We show how polynomial acceleration techniques which have been develop ed for the solution of large linear systems can be employed to improve and accelerate the frame algorithm. These methods permit a reduction in the number of necessary iterations by an order of magnitude when th e frame algorithm is slow. We give several examples from the theory of irregular sampling, from wavelet theory and from Gabor theory where t hese methods are probably mandatory for efficient reconstruction.