The crystallographic fast Fourier transform. Recursive symmetry reduction

Andrzej Kudlicki, Malgorzata Rowicka-Kudlicka, Zbyszek Otwinowski

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Algorithms are presented for maximally efficient computation of the crystallographic fast Fourier transform (FFT). The approach is applicable to all 230 space groups and allows reduction of both the computation time and the memory usage by a factor equal to the number of symmetry operators. The central idea is a recursive reduction of the problem to a series of transforms on grids with no special points. The maximally efficient FFT for such grids has been described in previous papers by the same authors. The interaction between the grid size factorization and the symmetry operators and its influence on the algorithm design are discussed.

Original languageEnglish (US)
Pages (from-to)465-480
Number of pages16
JournalActa Crystallographica Section A: Foundations of Crystallography
Volume63
Issue number6
DOIs
StatePublished - Oct 17 2007
Externally publishedYes

Fingerprint

Fourier Analysis
Fast Fourier transforms
grids
symmetry
Factorization
Mathematical operators
operators
Data storage equipment
factorization
interactions

Keywords

  • Fast Fourier transform
  • Recursive symmetry reduction

ASJC Scopus subject areas

  • Condensed Matter Physics
  • Structural Biology

Cite this

The crystallographic fast Fourier transform. Recursive symmetry reduction. / Kudlicki, Andrzej; Rowicka-Kudlicka, Malgorzata; Otwinowski, Zbyszek.

In: Acta Crystallographica Section A: Foundations of Crystallography, Vol. 63, No. 6, 17.10.2007, p. 465-480.

Research output: Contribution to journalArticle

@article{38ad87bb5612469f879b3c12cef98cf6,
title = "The crystallographic fast Fourier transform. Recursive symmetry reduction",
abstract = "Algorithms are presented for maximally efficient computation of the crystallographic fast Fourier transform (FFT). The approach is applicable to all 230 space groups and allows reduction of both the computation time and the memory usage by a factor equal to the number of symmetry operators. The central idea is a recursive reduction of the problem to a series of transforms on grids with no special points. The maximally efficient FFT for such grids has been described in previous papers by the same authors. The interaction between the grid size factorization and the symmetry operators and its influence on the algorithm design are discussed.",
keywords = "Fast Fourier transform, Recursive symmetry reduction",
author = "Andrzej Kudlicki and Malgorzata Rowicka-Kudlicka and Zbyszek Otwinowski",
year = "2007",
month = "10",
day = "17",
doi = "10.1107/S0108767307047411",
language = "English (US)",
volume = "63",
pages = "465--480",
journal = "Acta Crystallographica Section A: Foundations and Advances",
issn = "0108-7673",
publisher = "John Wiley and Sons Inc.",
number = "6",

}

TY - JOUR

T1 - The crystallographic fast Fourier transform. Recursive symmetry reduction

AU - Kudlicki, Andrzej

AU - Rowicka-Kudlicka, Malgorzata

AU - Otwinowski, Zbyszek

PY - 2007/10/17

Y1 - 2007/10/17

N2 - Algorithms are presented for maximally efficient computation of the crystallographic fast Fourier transform (FFT). The approach is applicable to all 230 space groups and allows reduction of both the computation time and the memory usage by a factor equal to the number of symmetry operators. The central idea is a recursive reduction of the problem to a series of transforms on grids with no special points. The maximally efficient FFT for such grids has been described in previous papers by the same authors. The interaction between the grid size factorization and the symmetry operators and its influence on the algorithm design are discussed.

AB - Algorithms are presented for maximally efficient computation of the crystallographic fast Fourier transform (FFT). The approach is applicable to all 230 space groups and allows reduction of both the computation time and the memory usage by a factor equal to the number of symmetry operators. The central idea is a recursive reduction of the problem to a series of transforms on grids with no special points. The maximally efficient FFT for such grids has been described in previous papers by the same authors. The interaction between the grid size factorization and the symmetry operators and its influence on the algorithm design are discussed.

KW - Fast Fourier transform

KW - Recursive symmetry reduction

UR - http://www.scopus.com/inward/record.url?scp=35348968908&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=35348968908&partnerID=8YFLogxK

U2 - 10.1107/S0108767307047411

DO - 10.1107/S0108767307047411

M3 - Article

VL - 63

SP - 465

EP - 480

JO - Acta Crystallographica Section A: Foundations and Advances

JF - Acta Crystallographica Section A: Foundations and Advances

SN - 0108-7673

IS - 6

ER -