Using NFFT 3---A software library for various nonequispaced fast Fourier transforms
J Keiner, S Kunis, D Potts - ACM Transactions on Mathematical Software …, 2009 - dl.acm.org
NFFT 3 is a software library that implements the nonequispaced fast Fourier transform
(NFFT) and a number of related algorithms, for example, nonequispaced fast Fourier …
(NFFT) and a number of related algorithms, for example, nonequispaced fast Fourier …
Antigenic waves of virus–immune coevolution
J Marchi, M Lässig, AM Walczak… - Proceedings of the …, 2021 - National Acad Sciences
The evolution of many microbes and pathogens, including circulating viruses such as
seasonal influenza, is driven by immune pressure from the host population. In turn, the …
seasonal influenza, is driven by immune pressure from the host population. In turn, the …
The GLT class as a generalized Fourier analysis and applications
S Serra-Capizzano - Linear Algebra and its Applications, 2006 - Elsevier
Recently, the class of Generalized Locally Toeplitz (GLT) sequences has been introduced
as a generalization both of classical Toeplitz sequences and of variable coefficient …
as a generalization both of classical Toeplitz sequences and of variable coefficient …
Fast kernel summation in high dimensions via slicing and Fourier transforms
J Hertrich - SIAM Journal on Mathematics of Data Science, 2024 - SIAM
Kernel-based methods are heavily used in machine learning. However, they suffer from
complexity in the number of considered data points. In this paper, we propose an …
complexity in the number of considered data points. In this paper, we propose an …
A dual‐space multilevel kernel‐splitting framework for discrete and continuous convolution
S Jiang, L Greengard - Communications on Pure and Applied …, 2023 - Wiley Online Library
We introduce a new class of multilevel, adaptive, dual‐space methods for computing fast
convolutional transformations. These methods can be applied to a broad class of kernels …
convolutional transformations. These methods can be applied to a broad class of kernels …
Comparison of scalable fast methods for long-range interactions
Based on a parallel scalable library for Coulomb interactions in particle systems, a
comparison between the fast multipole method (FMM), multigrid-based methods, fast Fourier …
comparison between the fast multipole method (FMM), multigrid-based methods, fast Fourier …
Accelerating the Sinkhorn algorithm for sparse multi-marginal optimal transport via fast Fourier transforms
FA Ba, M Quellmalz - Algorithms, 2022 - mdpi.com
We consider the numerical solution of the discrete multi-marginal optimal transport (MOT) by
means of the Sinkhorn algorithm. In general, the Sinkhorn algorithm suffers from the curse of …
means of the Sinkhorn algorithm. In general, the Sinkhorn algorithm suffers from the curse of …
Time and memory requirements of the nonequispaced FFT
S Kunis, D Potts - Sampling Theory in Signal and Image Processing, 2008 - Springer
We consider the fast Fourier transform at nonequispaced nodes (NFFT), and give detailed
information on the time and memory requirements of its building blocks. This manuscript …
information on the time and memory requirements of its building blocks. This manuscript …
Dithering by differences of convex functions
Motivated by a recent halftoning method which is based on electrostatic principles, we
analyze a halftoning framework where one minimizes a functional consisting of the …
analyze a halftoning framework where one minimizes a functional consisting of the …