File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/j.laa.2012.10.030
- Scopus: eid_2-s2.0-84872111695
- Find via

Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Article: Necessary and sufficient conditions to perform Spectral Tetris
| Title | Necessary and sufficient conditions to perform Spectral Tetris |
|---|---|
| Authors | |
| Keywords | Frames Majorization Redundancy Sparse matrices Sparsity Synthesis operator Tight frames |
| Issue Date | 2013 |
| Citation | Linear Algebra and Its Applications, 2013, v. 438, n. 5, p. 2239-2255 How to Cite? |
| Abstract | Spectral Tetris is a powerful tool for constructing sparse equal norm Hilbert space frames. We introduce a new form of Spectral Tetris which works for non-equal-norm frames. It is known that this method cannot construct all frames - even in the new case introduced here. Until now, it has been a mystery why Spectral Tetris sometimes works and sometimes fails. We provide a complete answer by giving necessary and sufficient conditions for Spectral Tetris to construct frames with prescribed vector norms and prescribed frame operator. We present a variety of examples and include cases where Spectral Tetris always works. © 2012 Elsevier Inc. All rights reserved. |
| Persistent Identifier | http://hdl.handle.net/10722/363719 |
| ISSN | 2023 Impact Factor: 1.0 2023 SCImago Journal Rankings: 0.837 |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Casazza, Peter G. | - |
| dc.contributor.author | Heinecke, Andreas | - |
| dc.contributor.author | Kornelson, Keri | - |
| dc.contributor.author | Wang, Yang | - |
| dc.contributor.author | Zhou, Zhengfang | - |
| dc.date.accessioned | 2025-10-10T07:48:53Z | - |
| dc.date.available | 2025-10-10T07:48:53Z | - |
| dc.date.issued | 2013 | - |
| dc.identifier.citation | Linear Algebra and Its Applications, 2013, v. 438, n. 5, p. 2239-2255 | - |
| dc.identifier.issn | 0024-3795 | - |
| dc.identifier.uri | http://hdl.handle.net/10722/363719 | - |
| dc.description.abstract | Spectral Tetris is a powerful tool for constructing sparse equal norm Hilbert space frames. We introduce a new form of Spectral Tetris which works for non-equal-norm frames. It is known that this method cannot construct all frames - even in the new case introduced here. Until now, it has been a mystery why Spectral Tetris sometimes works and sometimes fails. We provide a complete answer by giving necessary and sufficient conditions for Spectral Tetris to construct frames with prescribed vector norms and prescribed frame operator. We present a variety of examples and include cases where Spectral Tetris always works. © 2012 Elsevier Inc. All rights reserved. | - |
| dc.language | eng | - |
| dc.relation.ispartof | Linear Algebra and Its Applications | - |
| dc.subject | Frames | - |
| dc.subject | Majorization | - |
| dc.subject | Redundancy | - |
| dc.subject | Sparse matrices | - |
| dc.subject | Sparsity | - |
| dc.subject | Synthesis operator | - |
| dc.subject | Tight frames | - |
| dc.title | Necessary and sufficient conditions to perform Spectral Tetris | - |
| dc.type | Article | - |
| dc.description.nature | link_to_subscribed_fulltext | - |
| dc.identifier.doi | 10.1016/j.laa.2012.10.030 | - |
| dc.identifier.scopus | eid_2-s2.0-84872111695 | - |
| dc.identifier.volume | 438 | - |
| dc.identifier.issue | 5 | - |
| dc.identifier.spage | 2239 | - |
| dc.identifier.epage | 2255 | - |
