Acceleration of the frame algorithm

Abstract

Shows how polynomial acceleration techniques which have been developed 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 the frame algorithm is slow. The author gives several examples from the theory of irregular sampling, from wavelet theory and from Gabor theory where these methods are probably mandatory for efficient reconstruction.<>