Sparse high-dimensional FFT based on rank-1 lattice sampling (Q326763): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.acha.2015.05.002 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W988000559 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.acha.2015.05.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W988000559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3031434 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decoding by Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atomic Decomposition by Basis Pursuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multiscale sub-linear time Fourier algorithm for noisy data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing lattice rules based on weighted degree of exactness and worst case error / 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: Compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mathematical introduction to compressive sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fourier transform on sparse grids: Code design and the time dependent Schrödinger equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strang Splitting for the Time-Dependent Schrödinger Equation on Sparse Grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse grids for the Schrödinger equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Discrete Fourier Transform on Generalized Sparse Grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimized general sparse grid approximation spaces for operator equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fouriertransform on sparse grids with hierarchical bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly optimal sparse fourier transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743468 / 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 Hyperbolic Cross Trigonometric Polynomials by Sampling along Rank-1 Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing Multivariate Trigonometric Polynomials by Sampling Along Generated Sets / 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: On the stability of the hyperbolic cross discrete Fourier transform / 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: Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using NFFT 3---A Software Library for Various Nonequispaced Fast Fourier Transforms / 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: Q5482373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4451216 / 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: Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameter estimation for multivariate exponential sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameter estimation for nonincreasing exponential sums by Prony-like methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random sampling of sparse trigonometric polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5190161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability Results for Random Sampling of Sparse Trigonometric Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4889887 / 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: Q4348451 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probing the Pareto Frontier for Basis Pursuit Solutions / rank
 
Normal rank

Latest revision as of 16:57, 12 July 2024

scientific article
Language Label Description Also known as
English
Sparse high-dimensional FFT based on rank-1 lattice sampling
scientific article

    Statements

    Sparse high-dimensional FFT based on rank-1 lattice sampling (English)
    0 references
    0 references
    0 references
    12 October 2016
    0 references
    trigonometric polynomials
    0 references
    lattice rule
    0 references
    rank-1 lattice
    0 references
    sparse fast Fourier transform
    0 references
    approximation of multivariate functions
    0 references
    FFT
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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