Linked Life Data

17940325

Source:http://linkedlifedata.com/resource/pubmed/id/17940325

Statements in which the resource exists as a subject.
PredicateObject
rdf:type
lifeskim:mentions
pubmed:issue
Pt 6
pubmed:dateCreated
2007-10-17
pubmed:abstractText
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.
pubmed:grant
pubmed:language
eng
pubmed:journal
pubmed:citationSubset
IM
pubmed:status
MEDLINE
pubmed:month
Nov
pubmed:issn
0108-7673
pubmed:author
pubmed:issnType
Print
pubmed:volume
63
pubmed:owner
NLM
pubmed:authorsComplete
Y
pubmed:pagination
465-80
pubmed:meshHeading
pubmed:year
2007
pubmed:articleTitle
The crystallographic fast Fourier transform. Recursive symmetry reduction.
pubmed:affiliation
Department of Biochemistry, UT Southwestern Medical Center at Dallas, 5323 Harry Hines Boulevard, Dallas, TX 75390-8816, USA.
pubmed:publicationType
Journal Article, Research Support, N.I.H., Extramural