A decomposition method with minimum communication amount for parallelization of multi-dimensional FFTs

DOI10.1016/j.cpc.2013.08.028zbMath1344.65124arXiv1302.6189OpenAlexW2042478655MaRDI QIDQ313866

Taisuke Ozaki, Truong Vinh Truong Duy

Publication date: 12 September 2016

Published in: Computer Physics Communications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1302.6189

zbMATH Keywords

fast Fourier transformdomain decomposition methoddomain decomposition for FFTsmulti-dimensional FFTsparallel FFTs

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Parallel numerical computation (65Y05)

Related Items (1)

RESPACK: an \textit{ab initio} tool for derivation of effective low-energy model of material

Uses Software

• MKL
• OpenMx

Cites Work

• Parallel fast Fourier transforms for electronic structure calculations
• PFFT: An Extension of FFTW to Massively Parallel Architectures
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Scalable parallel FFT for spectral simulations on a Beowulf cluster

This page was built for publication: A decomposition method with minimum communication amount for parallelization of multi-dimensional FFTs