Results 1  10
of
20
Nonequispaced hyperbolic cross fast Fourier transform
"... A straightforward discretisation of problems in d spatial dimensions often leads to an exponential growth in the number of degrees of freedom. Thus, even efficient algorithms like the fast Fourier transform (FFT) have high computational costs. Hyperbolic cross approximations allow for a severe decre ..."
Abstract

Cited by 113 (3 self)
 Add to MetaCart
(Show Context)
A straightforward discretisation of problems in d spatial dimensions often leads to an exponential growth in the number of degrees of freedom. Thus, even efficient algorithms like the fast Fourier transform (FFT) have high computational costs. Hyperbolic cross approximations allow for a severe decrease in the number of used Fourier coefficients to represent functions with bounded mixed derivatives. We propose a nonequispaced hyperbolic cross fast Fourier transform based on one hyperbolic cross FFT and a dedicated interpolation by splines on sparse grids. Analogously to the nonequispaced FFT for trigonometric polynomials with Fourier coefficients supported on the full grid, this allows for the efficient evaluation of trigonometric polynomials with Fourier coefficients supported on the hyperbolic cross at arbitrary spatial sampling nodes. Key words and phrases: trigonometric approximation, hyperbolic cross, sparse grid, fast Fourier transform, nonequispaced FFT
NONLINEAR APPROXIMATION BY SUMS OF EXPONENTIALS AND TRANSLATES
"... In this paper, we discuss the numerical solution of two nonlinear approximation problems. Many applications in electrical engineering, signal processing, and mathematical physics lead to the following problem: Let h be a linear combination of exponentials with real frequencies. Determine all frequ ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
(Show Context)
In this paper, we discuss the numerical solution of two nonlinear approximation problems. Many applications in electrical engineering, signal processing, and mathematical physics lead to the following problem: Let h be a linear combination of exponentials with real frequencies. Determine all frequencies, all coefficients, and the number of summands, if finitely many perturbed, uniformly sampled data of h are given. We solve this problem by an approximate Prony method (APM) and prove the stability of the solution in the square and uniform norm. Further, an APM for nonuniformly sampled data is proposed too. The second approximation problem is related to the first one and reads as follows: Let ϕ be a given 1–periodic window function as defined in Section 4. Further let f be a linear combination of translates of ϕ. Determine all shift parameters, all coefficients, and the number of translates, if finitely many perturbed, uniformly sampled data of f are given. Using Fourier technique, this problem is transferred into the above parameter estimation problem for an exponential sum which is solved by APM. The stability of the solution is discussed in the square and uniform norm too. Numerical experiments show the performance of our approximation methods.
PARALLEL THREEDIMENSIONAL NONEQUISPACED FAST FOURIER TRANSFORMS AND THEIR APPLICATION TO PARTICLE SIMULATION
"... Abstract. In this paper we describe a parallel algorithm for calculating nonequispaced fast Fourier transforms on massively parallel distributed memory architectures. These algorithms are implemented in an open source software library called PNFFT. Furthermore, we derive a parallel fast algorithm fo ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
(Show Context)
Abstract. In this paper we describe a parallel algorithm for calculating nonequispaced fast Fourier transforms on massively parallel distributed memory architectures. These algorithms are implemented in an open source software library called PNFFT. Furthermore, we derive a parallel fast algorithm for the computation of the Coulomb potentials and forces in a charged particle system, which is based on the parallel nonequispaced fast Fourier transform. To prove the high scalability of our algorithms we provide performance results on a BlueGene/P system using up to 65536 cores. Key words and phrases: parallel nonequispaced fast Fourier transform, parallel fast summation, parallel particle mesh methods, NFFT
Particle Simulation Based on Nonequispaced Fast Fourier Transforms
"... The fast calculation of longrange interactions is a demanding problem in particle simulation. The main focus of our approach is the decomposition of the problem in building blocks and present efficient numerical realizations for these blocks. For that reason we recapitulate the fast Fourier transfo ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
The fast calculation of longrange interactions is a demanding problem in particle simulation. The main focus of our approach is the decomposition of the problem in building blocks and present efficient numerical realizations for these blocks. For that reason we recapitulate the fast Fourier transform at nonequispaced nodes and the fast summation method. We describe the application of these algorithms to the evaluation of longrange potentials and compare our methods with the existing fast multipole method.
OpenMP parallelization in the NFFT software library
, 2012
"... software library and present the used parallelization approaches. Besides the NFFT kernel, the NFFT on the twosphere and the fast summation based on NFFT are also parallelized. Thereby, the parallelization is based on OpenMP and the multithreaded FFTW library. Furthermore, benchmarks for various c ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
software library and present the used parallelization approaches. Besides the NFFT kernel, the NFFT on the twosphere and the fast summation based on NFFT are also parallelized. Thereby, the parallelization is based on OpenMP and the multithreaded FFTW library. Furthermore, benchmarks for various cases are performed. The results show that an efficiency higher than 0.50 and up to 0.79 can still be achieved at 12 threads. 1 Overview The NFFT3 library [3] and its MATLAB interface were parallelized using OpenMP [7]. Both the nonparallel version and the multithread OpenMP version of the NFFT3 library provide an identical Application Programming Interface (API). This is realized by using distinct library files for both versions. The nonparallel version of the NFFT3 library can be found in libnfft3.so and libnfft3.a, the multithread OpenMP version in libnfft3_threads.so and libnfft3_threads.a. For the MATLAB interface, the user has to specifiy at compile time whether the nonparallel or multithread OpenMP version should be built. The following kernels of the NFFT3 library were parallelized using OpenMP: • kernel/nfft: – NDFT (nonequidistant discrete Fourier transform)
Inverse Nonlinear Fourier Transforms Via Interpolation: The AblowitzLadik Case
"... Abstract—Nonlinear Fourier transforms arise when nonlinear evolution equations are solved with the inverse scattering method. In this paper, the inverse nonlinear Fourier transform that arises during the solution of the nonlinear Schrödinger equation on the real line is investigated. The inverse pro ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract—Nonlinear Fourier transforms arise when nonlinear evolution equations are solved with the inverse scattering method. In this paper, the inverse nonlinear Fourier transform that arises during the solution of the nonlinear Schrödinger equation on the real line is investigated. The inverse problem consists in the synthesis of a potential for the ZakharovShabat differential operator such that the spectrum of the operator fulfills certain prescribed properties. Instead of discretizing an exact solution for the continuous case, a numerical discretization of the forward transform is inverted exactly in this paper. The focus is on the case of finitely many samples, and the problems at hand take the form of interpolation problems. A connection between analytic interpolation with degree constraint and fiber Braggs grating design is established, leading to a new synthesis method. A new method to compute reflectionless potentials is presented as well.
Quadrature Nodes Meet Stippling Dots
"... Abstract. The stippling technique places black dots such that their density gives the impression of tone. This is the first paper that relates the distribution of stippling dots to the classical mathematical question of finding ’optimal ’ nodes for quadrature rules. More precisely, we consider quadr ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. The stippling technique places black dots such that their density gives the impression of tone. This is the first paper that relates the distribution of stippling dots to the classical mathematical question of finding ’optimal ’ nodes for quadrature rules. More precisely, we consider quadrature error functionals on reproducing kernel Hilbert spaces (RKHSs) with respect to the quadrature nodes and suggest to use optimal distributions of these nodes as stippling dot positions. Interestingly, in special cases, our quadrature errors coincide with discrepancy functionals and with recently proposed attractionrepulsion functionals. Our framework enables us to consider point distributions not only in R 2 but also on the torus T 2 and the sphere S 2. For a large number of dots the computation of their distribution is a serious challenge and requires fast algorithms. To this end, we work in RKHSs of bandlimited functions, where the quadrature error can be replaced by a least squares functional. We apply a nonlinear conjugate gradient (CG) method on manifolds to compute a minimizer of this functional and show that each step can be efficiently realized by nonequispaced fast Fourier transforms. We present numerical stippling results on S 2. 1
Reconstructing
"... hyperbolic cross trigonometric polynomials by sampling along generated sets ..."
Abstract
 Add to MetaCart
(Show Context)
hyperbolic cross trigonometric polynomials by sampling along generated sets