The Mermin fixed point

DOI10.1023/A:1026017302284zbMATH Open1222.94008arXivnlin/0206025OpenAlexW2998019241MaRDI QIDQ720541FDOQ720541

Veit Elser

Publication date: 17 October 2011

Published in: Foundations of Physics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/nlin/0206025

Recommendations

• scientific article; zbMATH DE number 18674
• An ellipsoid algorithm for the computation of fixed points
• On computing a fixed point of extremal mapping
• Computing of fixed points of extremal mappings
• scientific article; zbMATH DE number 4024659

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Cited In (1)

• The KPZ fixed point

This page was built for publication: The Mermin fixed point

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q720541)