Acceleration of the frame algorithm
- 1 December 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 41 (12) , 3331-3340
- https://doi.org/10.1109/78.258077
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.<>Keywords
This publication has 20 references indexed in Scilit:
- A discrete theory of irregular samplingLinear Algebra and its Applications, 1993
- Irregular sampling of wavelet and short-time Fourier transformsConstructive Approximation, 1993
- Reconstruction Algorithms in Irregular SamplingMathematics of Computation, 1992
- Describing functions: Atomic decompositions versus framesMonatshefte für Mathematik, 1991
- A discrete transform and decompositions of distribution spacesJournal of Functional Analysis, 1990
- The wavelet transform, time-frequency localization and signal analysisIEEE Transactions on Information Theory, 1990
- Iterative Methods in Irregular Sampling Theory, Numerical ResultsPublished by Springer Nature ,1990
- Some Aspects of Non-Stationary Signal Processing with Emphasis on Time-Frequency and Time-Scale MethodsPublished by Springer Nature ,1989
- Frames in the bargmann space of entire functionsCommunications on Pure and Applied Mathematics, 1988
- Painless nonorthogonal expansionsJournal of Mathematical Physics, 1986