NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2
  • Tagged with
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Search results

Showing 1 to 2 of 2 (0.043 seconds)

Spelling suggestions: "subject:"taylorentwicklung"" "subject:"taylorentwickelung""

1

Taylor and rank-1 lattice based nonequispaced fast Fourier transform

Volkmer, Toni 25 February 2013 (has links) (PDF)
The nonequispaced fast Fourier transform (NFFT) allows the fast approximate evaluation of trigonometric polynomials with frequencies supported on full box-shaped grids at arbitrary sampling nodes. Due to the curse of dimensionality, the total number of frequencies and thus, the total arithmetic complexity can already be very large for small refinements at medium dimensions. In this paper, we present an approach for the fast approximate evaluation of trigonometric polynomials with frequencies supported on an arbitrary subset of the full grid at arbitrary sampling nodes, which is based on Taylor expansion and rank-1 lattice methods. For the special case of symmetric hyperbolic cross index sets in frequency domain, we present error estimates and numerical results.
NFFT
FFT
Rang-1-Gitter
Taylor-Entwicklung
hyperbolisches Kreuz
nonequispaced fast Fourier transform
NFFT
FFT
rank-1 lattice
Taylor expansion
hyperbolic cross
ddc:004
ddc:518
Schnelle Fourier-Transformation
2

Taylor and rank-1 lattice based nonequispaced fast Fourier transform

Volkmer, Toni 25 February 2013 (has links)
The nonequispaced fast Fourier transform (NFFT) allows the fast approximate evaluation of trigonometric polynomials with frequencies supported on full box-shaped grids at arbitrary sampling nodes. Due to the curse of dimensionality, the total number of frequencies and thus, the total arithmetic complexity can already be very large for small refinements at medium dimensions. In this paper, we present an approach for the fast approximate evaluation of trigonometric polynomials with frequencies supported on an arbitrary subset of the full grid at arbitrary sampling nodes, which is based on Taylor expansion and rank-1 lattice methods. For the special case of symmetric hyperbolic cross index sets in frequency domain, we present error estimates and numerical results.
info:eu-repo/classification/ddc/004
ddc:004
info:eu-repo/classification/ddc/518
ddc:518
Schnelle Fourier-Transformation

Page generated in 0.0477 seconds