Pith. sign in

REVIEW

Eigenvector Phase Retrieval: Recovering eigenvectors from the absolute value of their entries

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2109.11143 v3 pith:BGYYYFST submitted 2021-09-23 math.FA

Eigenvector Phase Retrieval: Recovering eigenvectors from the absolute value of their entries

classification math.FA
keywords lambdaeigenvalueproblemabsolutealgorithmcaseentriesmathbb
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We consider the eigenvalue problem $Ax = \lambda x$ where $A \in \mathbb{R}^{n \times n}$ and the eigenvalue is also real $\lambda \in \mathbb{R}$. If we are given $A$, $\lambda$ and, additionally, the absolute value of the entries of $x$ (the vector $(|x_i|)_{i=1}^n$), is there a fast way to recover $x$? In particular, can this be done quicker than computing $x$ from scratch? This may be understood as a special case of the phase retrieval problem. We present a randomized algorithm which provably converges in expectation whenever $\lambda$ is a simple eigenvalue. The problem should become easier when $|\lambda|$ is large and we discuss another algorithm for that case as well.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.