Fast and provable algorithms for spectrally sparse signal reconstruction via low-rank Hankel matrix completion (Q1990969)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fast and provable algorithms for spectrally sparse signal reconstruction via low-rank Hankel matrix completion |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast and provable algorithms for spectrally sparse signal reconstruction via low-rank Hankel matrix completion |
scientific article |
Statements
Fast and provable algorithms for spectrally sparse signal reconstruction via low-rank Hankel matrix completion (English)
0 references
29 October 2018
0 references
spectrally sparse signal
0 references
low rank Hankel matrix completion
0 references
iterative hard thresholding
0 references
composite hard thresholding operator
0 references
0 references
0 references
0 references
0.8585513234138489
0 references
0.7992797493934631
0 references
0.7539002299308777
0 references
0.7505474090576172
0 references
0.7329539656639099
0 references
