High-dimensional sparse FFT based on sampling along multiple rank-1 lattices (Q2659735): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1711.05152 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4889887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: High-dimensional integration: The quasi-Monte Carlo way / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional pseudo-spectral methods on lattice grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fast Fourier transform and fast wavelet transform for patterns on the torus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstruction of periodic functions of several variables with respect to the values in the nodes of number-theoretic nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5482373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice rule algorithms for multivariate approximation in the average case setting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice algorithms for multivariate \(L_{\infty}\) approximation in the worst-case setting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight error bounds for rank-1 lattice sampling in spaces of hybrid mixed smoothness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple rank-1 lattices as sampling schemes for multivariate trigonometric polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing spatial discretizations for sparse multivariate trigonometric polynomials that allow for a fast discrete Fourier transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice rules with random \(n\) achieve nearly the optimal \(\mathcal{O}(n^{-\alpha-1/2})\) error independently of the dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mathematical introduction to compressive sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Methods for the Fourier Analysis of Sparse High-Dimensional Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743468 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly optimal sparse fourier transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Nearly) Sample-Optimal Sparse Fourier Transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation guarantees for sublinear-time Fourier algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit universal sampling sets in finite vector spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse high-dimensional FFT based on rank-1 lattice sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing Multivariate Trigonometric Polynomials from Samples Along Rank-1 Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameter estimation for multivariate exponential sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131338 / rank
 
Normal rank

Latest revision as of 21:48, 24 July 2024

scientific article
Language Label Description Also known as
English
High-dimensional sparse FFT based on sampling along multiple rank-1 lattices
scientific article

    Statements

    High-dimensional sparse FFT based on sampling along multiple rank-1 lattices (English)
    0 references
    0 references
    0 references
    0 references
    26 March 2021
    0 references
    0 references
    sparse fast Fourier transform
    0 references
    FFT
    0 references
    multivariate trigonometric polynomials
    0 references
    lattice rule
    0 references
    multiple rank-1 lattices
    0 references
    approximation of multivariate functions
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references