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...
Gespeichert in:
| Veröffentlicht in: | arXiv.org 2019-07 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | arXiv.org |
| container_volume | |
| creator | Przybylek, Michal R Siedlecki, Pawel |
| description | 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. |
| doi_str_mv | 10.48550/arxiv.1907.09371 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_1907_09371</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2262541107</sourcerecordid><originalsourceid>FETCH-LOGICAL-a527-78052caba29d42a1ce6996b556a16d385525ab5ef6db56abf468fd86df5ca7a03</originalsourceid><addsrcrecordid>eNotj8tqwzAUREWh0JDmA7qqoGu70pUl2buG0BcEusneXNsSUbAtV1JK8vd1k66GGYZhDiEPnOVFKSV7xnByPzmvmM5ZJTS_IQsQgmdlAXBHVjEeGGOgNEgpFuRlTUefDPUjTXtDWz9MvTm5dKbeUqTTHqPpTYx08v159IPDnroxmTB7TM6P9-TWYh_N6l-XZPf2utt8ZNuv98_NepuhBJ3pkklosUGougKQt0ZVlWqkVMhVJ-bjILGRxqqumbPGFqq0Xak6K1vUyMSSPF5nL3j1FNyA4Vz_YdYXzLnxdG1MwX8fTUz1wR_DOH-qARTIgnOmxS9APlWO</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2262541107</pqid></control><display><type>article</type><title>A note on the complexity of a phaseless polynomial interpolation</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Przybylek, Michal R ; Siedlecki, Pawel</creator><creatorcontrib>Przybylek, Michal R ; Siedlecki, Pawel</creatorcontrib><description>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.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.1907.09371</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Complexity ; Computer Science - Computational Complexity ; Computer Science - Numerical Analysis ; Interpolation ; Mathematics - Numerical Analysis ; Polynomials</subject><ispartof>arXiv.org, 2019-07</ispartof><rights>2019. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,784,885,27925</link.rule.ids><backlink>$$Uhttps://doi.org/10.1016/j.jco.2019.101456$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.48550/arXiv.1907.09371$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Przybylek, Michal R</creatorcontrib><creatorcontrib>Siedlecki, Pawel</creatorcontrib><title>A note on the complexity of a phaseless polynomial interpolation</title><title>arXiv.org</title><description>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.</description><subject>Complexity</subject><subject>Computer Science - Computational Complexity</subject><subject>Computer Science - Numerical Analysis</subject><subject>Interpolation</subject><subject>Mathematics - Numerical Analysis</subject><subject>Polynomials</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GOX</sourceid><recordid>eNotj8tqwzAUREWh0JDmA7qqoGu70pUl2buG0BcEusneXNsSUbAtV1JK8vd1k66GGYZhDiEPnOVFKSV7xnByPzmvmM5ZJTS_IQsQgmdlAXBHVjEeGGOgNEgpFuRlTUefDPUjTXtDWz9MvTm5dKbeUqTTHqPpTYx08v159IPDnroxmTB7TM6P9-TWYh_N6l-XZPf2utt8ZNuv98_NepuhBJ3pkklosUGougKQt0ZVlWqkVMhVJ-bjILGRxqqumbPGFqq0Xak6K1vUyMSSPF5nL3j1FNyA4Vz_YdYXzLnxdG1MwX8fTUz1wR_DOH-qARTIgnOmxS9APlWO</recordid><startdate>20190723</startdate><enddate>20190723</enddate><creator>Przybylek, Michal R</creator><creator>Siedlecki, Pawel</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20190723</creationdate><title>A note on the complexity of a phaseless polynomial interpolation</title><author>Przybylek, Michal R ; Siedlecki, Pawel</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a527-78052caba29d42a1ce6996b556a16d385525ab5ef6db56abf468fd86df5ca7a03</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Complexity</topic><topic>Computer Science - Computational Complexity</topic><topic>Computer Science - Numerical Analysis</topic><topic>Interpolation</topic><topic>Mathematics - Numerical Analysis</topic><topic>Polynomials</topic><toplevel>online_resources</toplevel><creatorcontrib>Przybylek, Michal R</creatorcontrib><creatorcontrib>Siedlecki, Pawel</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Przybylek, Michal R</au><au>Siedlecki, Pawel</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A note on the complexity of a phaseless polynomial interpolation</atitle><jtitle>arXiv.org</jtitle><date>2019-07-23</date><risdate>2019</risdate><eissn>2331-8422</eissn><abstract>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.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.1907.09371</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | EISSN: 2331-8422 |
| ispartof | arXiv.org, 2019-07 |
| issn | 2331-8422 |
| language | eng |
| recordid | cdi_arxiv_primary_1907_09371 |
| source | arXiv.org; Free E- Journals |
| subjects | Complexity Computer Science - Computational Complexity Computer Science - Numerical Analysis Interpolation Mathematics - Numerical Analysis Polynomials |
| title | A note on the complexity of a phaseless polynomial interpolation |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-26T03%3A28%3A51IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20note%20on%20the%20complexity%20of%20a%20phaseless%20polynomial%20interpolation&rft.jtitle=arXiv.org&rft.au=Przybylek,%20Michal%20R&rft.date=2019-07-23&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.1907.09371&rft_dat=%3Cproquest_arxiv%3E2262541107%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2262541107&rft_id=info:pmid/&rfr_iscdi=true |