A Parallel Prime Edge-Length Crystallographic FFT

DOI10.1007/3-540-44863-2_59MaRDI QIDQ3566800zbMATH OpenOpenAlexFDO

Authors Jaime Seguel, Daniel Burbano

Publication date 10 June 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44863-2_59

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• scientific article; zbMATH DE number 2087117
• Computational Science and Its Applications – ICCSA 2004
• scientific article; zbMATH DE number 991433
• Parallel fast Fourier transforms for electronic structure calculations
• A PARALLEL FAST FOURIER TRANSFORM
• Factorization method for crystallographic Fourier transforms
• The crystallographic fast Fourier transform. Recursive symmetry reduction
• scientific article; zbMATH DE number 147703

Cited in

(2)

• scientific article; zbMATH DE number 2087117 (Why is no real title available?)
• Computational Science and Its Applications – ICCSA 2004

This page was built for publication: A Parallel Prime Edge-Length Crystallographic FFT

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3566800)