English
Related papers

Related papers: Flexible Multi-Dimensional FFTs for Plane Wave Den…

200 papers

The Discrete Fourier Transform (DFT) is essential for various applications ranging from signal processing to convolution and polynomial multiplication. The groundbreaking Fast Fourier Transform (FFT) algorithm reduces DFT time complexity…

Hardware Architecture · Computer Science 2023-04-06 Orian Leitersdorf , Yahav Boneh , Gonen Gazit , Ronny Ronen , Shahar Kvatinsky

The nonuniform fast Fourier transform (NUFFT) generalizes the FFT to off-grid data. Its many applications include image reconstruction, data analysis, and the numerical solution of differential equations. We present FINUFFT, an efficient…

Numerical Analysis · Mathematics 2019-04-10 Alex H. Barnett , Jeremy F. Magland , Ludvig af Klinteberg

Conduction transfer functions (CTF) are commonly used in the building services to quickly estimate hourly conduction heat loads through multilayered walls without resorting to expensive, time-consuming solutions of the heat equation. It is…

Computational Engineering, Finance, and Science · Computer Science 2021-10-26 Khodr Jaber

In this paper, I discuss the challenges in porting hydrodynamic codes to futuristic exascale HPC systems. In particular, we describe the computational complexities of finite difference method, pseudo-spectral method, and Fast Fourier…

Computational Physics · Physics 2019-11-25 Mahendra K. Verma

We describe the performance of our latest generations of sensitive wide-band high-resolution digital Fast Fourier Transform Spectrometer (FFTS). Their design, optimized for a wide range of radio astronomical applications, is presented.…

Instrumentation and Methods for Astrophysics · Physics 2015-06-04 Bernd Klein , Stefan Hochgürtel , Ingo Krämer , Andreas Bell , Klaus Meyer , Rolf Güsten

Density Functional Tight-Binding (DFTB), an approximative approach derived from Density Functional Theory (DFT), has the potential to pave the way for simulations of large periodic or non-periodic systems. We have specifically tailored DFTB…

Fast Fourier Transform (FFT) is an efficient algorithm to compute the Discrete Fourier Transform (DFT) and its inverse. In this paper, we pay special attention to the description of complex-data FFT. We analyze two common descriptions of…

Numerical Analysis · Computer Science 2011-10-28 Zhengjun Cao , Xiao Fan

Tools for computing detailed optically thick spectral line profiles out of local thermodynamic equilibrium have always been focused on speed, due to the large computational effort involved. With the Lightweaver framework, we have produced a…

Instrumentation and Methods for Astrophysics · Physics 2021-08-18 Christopher M J Osborne , Ivan Milić

Recent developments in machine learning and signal processing have resulted in many new techniques that are able to effectively capture the intrinsic yet complex properties of hyperspectral imagery. Tasks ranging from anomaly detection to…

Computer Vision and Pattern Recognition · Computer Science 2020-11-24 Ilya Kavalerov , Weilin Li , Wojciech Czaja , Rama Chellappa

Fourier transform (FT) plays a crucial role in a broad range of applications, from enhancement, restoration and analysis through to security, compression and manipulation. The Fourier transform (FT) is a process that converts a function…

Numerical Analysis · Mathematics 2023-05-05 Benjamin Kenwright

Diffuse scattering is a rich source of information about disorder in crystalline materials, which can be modelled using atomistic techniques such as Monte Carlo and molecular dynamics simulations. Modern X-ray and neutron scattering…

Materials Science · Physics 2018-12-21 Joseph A. M. Paddison

Pretrained transformers provide rich, general-purpose embeddings, which are transferred to downstream tasks. However, current transfer strategies: fine-tuning and probing, either distort the pretrained geometric structure of the embeddings…

Machine Learning · Computer Science 2025-12-01 Pankhil Gawade , Adam Izdebski , Myriam Lizotte , Kevin R. Moon , Jake S. Rhodes , Guy Wolf , Ewa Szczurek

Discrete Fourier Transform (DFT) libraries are one of the most critical software components for scientific computing. Inspired by FFTW, a widely used library for DFT HPC calculations, we apply compiler technologies for the development of…

Mathematical Software · Computer Science 2022-07-27 Yifei He , Artur Podobas , Måns I. Andersson , Stefano Markidis

Neural networks commonly execute on hardware accelerators such as NPUs and GPUs for their size and computation overhead. These accelerators are costly and it is hard to scale their resources to handle real-time workload fluctuations. We…

Machine Learning · Computer Science 2025-10-06 Jaemin Kim , Hongjun Um , Sungkyun Kim , Yongjun Park , Jiwon Seo

This paper aims to address a common challenge in deep learning-based image transformation methods, such as image enhancement and super-resolution, which heavily rely on precisely aligned paired datasets with pixel-level alignments. However,…

Computer Vision and Pattern Recognition · Computer Science 2024-02-29 Zhangkai Ni , Juncheng Wu , Zian Wang , Wenhan Yang , Hanli Wang , Lin Ma

Density Functional Theory (DFT) is the de facto workhorse for large-scale electronic structure calculations in chemistry and materials science. While plane-wave DFT implementations remain the most widely used, real-space DFT provides…

Decades accumulation of theory simulations lead to boom in material database, which combined with machine learning methods has been a valuable driver for the data-intensive material discovery, i.e., the fourth research paradigm. However,…

Materials Science · Physics 2025-02-10 Tiancheng Ma , Zihan Zhang , Shuting Wu , Defang Duan , Tian Cui

Density Functional Theory (DFT) is widely used for first-principles simulations in chemistry and materials science, but its computational cost remains a key limitation for large systems. Motivated by recent advances in ML-based…

Materials Science · Physics 2026-02-19 Rakshit Kumar Singh , Aryan Amit Barsainyan , Bharath Ramsundar

We present a new library for parallel distributed Fast Fourier Transforms (FFT). The importance of FFT in science and engineering and the advances in high performance computing necessitate further improvements. AccFFT extends existing FFT…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-05-27 Amir Gholami , Judith Hill , Dhairya Malhotra , George Biros

Fast multidimensional convolution can be performed naively in quadratic time and can often be performed more efficiently via the Fourier transform; however, when the dimensionality is large, these algorithms become more challenging. A…

Computational Geometry · Computer Science 2016-08-02 Oliver Serang
‹ Prev 1 4 5 6 7 8 10 Next ›