A deterministic algorithm for constructing multiple rank-1 lattices of near-optimal size (Q2070286): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s10444-021-09916-0 / rank
Normal rank
 
Property / cites work
 
Property / cites work: A deterministic sparse FFT for functions with structured Fourier sparsity / 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: Compressed sensing and best 𝑘-term approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mathematical introduction to compressive sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial sublinear-time Fourier algorithms / 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: Reconstructing Multivariate Trigonometric Polynomials from Samples Along Rank-1 Lattices / 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: Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: High-dimensional sparse FFT based on sampling along multiple rank-1 lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of multivariate periodic functions based on sampling along multiple rank-1 lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Function integration, reconstruction and approximation using rank-$1$ lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new class of fully discrete sparse Fourier transforms: faster stable implementations with guarantees / 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: Numerical Fourier analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate formulas for some functions of prime numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved sparse Fourier approximation results: Faster implementations and stronger guarantees / 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 / DOI
 
Property / DOI: 10.1007/S10444-021-09916-0 / rank
 
Normal rank

Latest revision as of 08:10, 28 December 2024

scientific article
Language Label Description Also known as
English
A deterministic algorithm for constructing multiple rank-1 lattices of near-optimal size
scientific article

    Statements

    A deterministic algorithm for constructing multiple rank-1 lattices of near-optimal size (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 January 2022
    0 references
    approximation of multivariate periodic functions
    0 references
    trigonometric polynomials
    0 references
    lattice rule
    0 references
    multiple rank-1 lattice
    0 references
    fast Fourier transform
    0 references
    sampling numbers
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references