Abstract
The most efficient known method for solving certain computational problems is to construct an iterated map whose fixed points are by design the problem's solution. Although the origins of this idea go back at least to Newton, the clearest expression of its logical basis is an example due to Mermin. A contemporary application in image recovery demonstrates the power of the method.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
N. D. Mermin, private communication and old Physics 209 homework problem (unpublished).
R. P. Millane, “Phase retrieval in crystallography and optics”, J. Opt. Soc. Am. A 7, 394–411 (1990).
J. R. Fienup, T. R. Crimmins, and W. Holsztynski, “Reconstruction of the support of an object from the support of its autocorrelation”, J. Opt. Soc. Am. 72, 610–624 (1982).
H. Stark and Y. Yang, Vector Space Projections (Wiley, 1998).
J. Miao, D. Sayre, and H. N. Chapman, “Phase retrieval from the magnitude of the Fourier transforms of nonperiodic objects”, J. Opt. Soc. Am. A 15, 1662–1669 (1998).
V. Elser, “Phase retrieval by iterated projections”, J. Opt. Soc. Am. A 20, 40–55 (2003).
J. R. Fienup, “Phase retrieval algorithms: A comparison”, Appl. Opt. 21, 2758–2769 (1982).
H. H Bauschke, P. L. Combettes, and D. R. Luke, “Phase retrieval, Gerchberg–Saxton algorithm, and Fienup variants: A view from convex optimization”, J. Opt. Soc. Am. A 19, 1334–1345 (2002).
M. Zwick, B. Lovell, and J. Marsh, “Global optimization studies on the 1-D phase problem”, Internat. J. Gen. Syst. 25, 47–59 (1996).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Elser, V. The Mermin Fixed Point. Foundations of Physics 33, 1691–1698 (2003). https://doi.org/10.1023/A:1026017302284
Issue Date:
DOI: https://doi.org/10.1023/A:1026017302284