Approximation and interpolation of singular measures by trigonometric polynomials

Trigonometric interpolation (42A15) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical methods for trigonometric approximation and interpolation (65T40)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Computational Optimal Transport: With Applications to Data Science
Exact reconstruction using Beurling minimal extrapolation
Interpolation and \(L_1\)-approximation by trigonometric polynomials and blending functions
Prony's method in several variables
Support recovery for sparse super-resolution of positive measures
A multivariate generalization of Prony's method
Best approximation by polynomials
Polynomial-exponential decomposition from moments
Prony's method under an almost sharp multivariate Ingham inequality
The Kantorovich metric for probability measures on the circle
The Gibbs phenomenon for best \(L_ 1\)-trigonometric polynomial approximation
Sparse polynomial interpolation: sparse recovery, super-resolution, or Prony?
The empirical Christoffel function with applications in data analysis
Semi-algebraic approximation using Christoffel-Darboux kernel
Curve based approximation of measures on manifolds by discrepancy minimization
Multivariate Vandermonde matrices with separated nodes on the unit circle are stable
On the smallest singular value of multivariate Vandermonde matrices with clustered nodes
A randomized multivariate matrix pencil method for superresolution microscopy
Super-resolution meets machine learning: approximation of measures
Sur les meilleurs procédés d'approximation de certaines classes de fonctions par des polynomes trigonométriques.
Data analysis from empirical moments and the Christoffel function
The Approach of Moments for Polynomial Equations
Super-resolution, Extremal Functions and the Condition Number of Vandermonde Matrices
Exact Solutions to Super Resolution on Semi-Algebraic Domains in Higher Dimensions
Off-the-Grid Recovery of Piecewise Constant Images from Few Fourier Samples
Matrix pencil method for estimating parameters of exponentially damped/undamped sinusoids in noise
Sampling Curves With Finite Rate of Innovation
Arb: Efficient Arbitrary-Precision Midpoint-Radius Interval Arithmetic
Sampling and Reconstruction of Shapes With Algebraic Boundaries
Multidimensional ESPRIT for Damped and Undamped Signals: Algorithm, Computations, and Perturbation Analysis
MultiDimensional Sparse Super-Resolution
ESPRIT for Multidimensional General Grids
Christoffel Functions and Universality in the Bulk for Multivariate Orthogonal Polynomials
Prony methods for recovery of structured functions
Super-Resolution Limit of the ESPRIT Algorithm
Classical Fourier Analysis
Numerical Methods in Matrix Computations
Towards a Mathematical Theory of Super‐resolution
Optimal Transport
Positive trigonometric polynomials and signal processing applications
Nonequispaced fast Fourier transform boost for the Sinkhorn algorithm
Short Communication: Weak Sparse Superresolution is Well-Conditioned

This page was built for publication: Approximation and interpolation of singular measures by trigonometric polynomials