R.I.P.
👻
Ghosted
Implementation of discretized Gabor frames and their duals
June 23, 2015 · Declared Dead · 🏛 IEEE Transactions on Information Theory
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Tobias Kloos, Joachim Stöckler, Karlheinz Gröchenig
arXiv ID
1506.06918
Category
math.NA: Numerical Analysis
Cross-listed
cs.IT
Citations
9
Venue
IEEE Transactions on Information Theory
Last Checked
2 months ago
Abstract
The usefulness of Gabor frames depends on the easy computability of a suitable dual window. This question is addressed under several aspects: several versions of Schulz's iterative algorithm for the approximation of the canonical dual window are analyzed for their numerical stability. For Gabor frames with totally positive windows or with exponential B-splines a direct algorithm yields a family of exact dual windows with compact support. It is shown that these dual windows converge exponentially fast to the canonical dual window.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
📜 Similar Papers
In the same crypt — Numerical Analysis
R.I.P.
👻
Ghosted
Deep learning-based numerical methods for high-dimensional parabolic partial differential equations and backward stochastic differential equations
R.I.P.
👻
Ghosted
PDE-Net: Learning PDEs from Data
R.I.P.
👻
Ghosted
Efficient tensor completion for color image and video recovery: Low-rank tensor train
R.I.P.
👻
Ghosted
Tensor Ring Decomposition
R.I.P.
👻
Ghosted
Machine learning approximation algorithms for high-dimensional fully nonlinear partial differential equations and second-order backward stochastic differential equations
Died the same way — 👻 Ghosted
R.I.P.
👻
Ghosted
Language Models are Few-Shot Learners
R.I.P.
👻
Ghosted
PyTorch: An Imperative Style, High-Performance Deep Learning Library
R.I.P.
👻
Ghosted
XGBoost: A Scalable Tree Boosting System
R.I.P.
👻
Ghosted