A note on the complexity of a phaseless polynomial interpolation

A note on the complexity of a phaseless polynomial interpolation

In this paper we revisit the classical problem of polynomial interpolation, with a slight twist; namely, polynomial evaluations are available up to a group action of the unit circle on the complex plane. It turns out that this new setting allows for a phaseless recovery of a polynomial in a polynomi...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2019-07
Hauptverfasser: Przybylek, Michal R, Siedlecki, Pawel
Format: Artikel
Sprache:eng
Schlagworte:
Complexity
Computer Science - Computational Complexity
Computer Science - Numerical Analysis
Interpolation
Mathematics - Numerical Analysis
Polynomials
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper we revisit the classical problem of polynomial interpolation, with a slight twist; namely, polynomial evaluations are available up to a group action of the unit circle on the complex plane. It turns out that this new setting allows for a phaseless recovery of a polynomial in a polynomial time.
ISSN:2331-8422
DOI:10.48550/arxiv.1907.09371