Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2024 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Stability in phase retrieval: Characterizing condition numbers and the optimal vector set
HTML articles powered by AMS MathViewer

by Yu Xia, Zhiqiang Xu and Zili Xu;
Math. Comp.
DOI: https://doi.org/10.1090/mcom/4042
Published electronically: November 14, 2024

Abstract:

In this paper, we primarily focus on analyzing the stability property of phase retrieval by examining the bi-Lipschitz property of the map $\Phi _{\boldsymbol {A}}(\boldsymbol {x})=|\boldsymbol {A}\boldsymbol {x}|\in \mathbb {R}_+^m$, where $\boldsymbol {x}\in \mathbb {H}^d$ and $\boldsymbol {A}\in \mathbb {H}^{m\times d}$ is the measurement matrix for $\mathbb {H}\in \{\mathbb {R},\mathbb {C}\}$. We define the condition number $\beta _{\boldsymbol {A}}=\frac {U_{\boldsymbol {A}}}{L_{\boldsymbol {A}}}$, where $L_{\boldsymbol {A}}$ and $U_{\boldsymbol {A}}$ represent the optimal lower and upper Lipschitz constants, respectively. We establish the universal lower bound on $\beta _{\boldsymbol {A}}$ by demonstrating that for any ${\boldsymbol {A}}\in \mathbb {H}^{m\times d}$, \begin{equation*} \beta _{\boldsymbol {A}}\geq \beta _0^{\mathbb {H}}= \begin {cases} \sqrt {\frac {\pi }{\pi -2}}\approx 1.659 & \text {if $\mathbb {H}=\mathbb {R}$,}\\ \sqrt {\frac {4}{4-\pi }}\approx 2.159 & \text {if $\mathbb {H}=\mathbb {C}$.} \end{cases} \end{equation*} We prove that the condition number of a standard Gaussian matrix in $\mathbb {H}^{m\times d}$ asymptotically matches the lower bound $\beta _0^{\mathbb {H}}$ for both real and complex cases. This result indicates that the constant lower bound $\beta _0^{\mathbb {H}}$ is asymptotically tight, holding true for both the real and complex scenarios. As an application of this result, we utilize it to investigate the performance of quadratic models for phase retrieval. Lastly, we establish that for any odd integer $m\geq 3$, the harmonic frame $\boldsymbol {A}\in \mathbb {R}^{m\times 2}$ possesses the minimum condition number among all $\boldsymbol {A}\in \mathbb {R}^{m\times 2}$.

To the best of our knowledge, our findings provide the first universal lower bound for the condition number in phase retrieval. Additionally, we have identified the first optimal vector set in $\mathbb {R}^2$ for phase retrieval. We are confident that these findings carry substantial implications for enhancing our understanding of phase retrieval.

References
Similar Articles
Bibliographic Information
  • Yu Xia
  • Affiliation: Department of Mathematics, Hangzhou Normal University, Hangzhou 311121, People’s Republic of China
  • ORCID: 0000-0003-2354-2227
  • Email: yxia@hznu.edu.cn
  • Zhiqiang Xu
  • Affiliation: LSEC, Inst. Comp. Math., Academy of Mathematics and System Science, Chinese Academy of Sciences, Beijing 100091, People’s Republic of China; and School of Mathematical Sciences, University of Chinese Academy of Sciences, Beijing 100049, People’s Republic of China
  • MR Author ID: 690372
  • Email: xuzq@lsec.cc.ac.cn
  • Zili Xu
  • Affiliation: School of Mathematical Sciences, East China Normal University, Shanghai 200241, People’s Republic of China; Shanghai Key Laboratory of PMMP, East China Normal University, Shanghai 200241, People’s Republic of China; and Key Laboratory of MEA, Ministry of Education, East China Normal University, Shanghai 200241, People’s Republic of China
  • MR Author ID: 1424444
  • Email: zlxu@math.ecnu.edu.cn
  • Received by editor(s): April 11, 2024
  • Received by editor(s) in revised form: April 16, 2024, August 13, 2024, and October 2, 2024
  • Published electronically: November 14, 2024
  • Additional Notes: The first author was supported by NSFC grant (12271133, U21A20426, 11901143) and the key project of Zhejiang Provincial Natural Science Foundation grant (LZ23A010002). The second author was supported in part by the National Science Fund for Distinguished Young Scholars under Grant 12025108 and in part by the National Natural Science Foundation of China under Grant 12471361, Grant 12021001 and Grant 12288201.
    The third author is the corresponding author.
  • © Copyright 2024 American Mathematical Society
  • Journal: Math. Comp.
  • MSC (2020): Primary 94A15, 46C05; Secondary 94A12, 49N45
  • DOI: https://doi.org/10.1090/mcom/4042