The discrete Gerchberg algorithm

The discrete version of the Gerchberg algorithm for iterative restoration of a time-constrained function from only partial knowledge of its spectrum (or vice versa) is analyzed. Although convergence is guaranteed, eigenvalues close to unity inhibit iteration to the limit. Identification of these large eigenvalues, allowing extrapolation to the limit, is described.