By Topic

Fourier transforms that respect crystallographic symmetries

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
L. Auslander ; City University of New York, Center for Large Scale Computation, 10036, USA ; M. Shenefelt

In crystallography one has to compute finite Fourier transforms that are often very large and often respect crystallographic symmetries. In this paper we discuss efficient finite Fourier transform algorithms on 5×5×5 points that respect a collection of crystallographic symmetries. Although the size is too small for any practical problems, the methods indicated in this paper can be extended to problems of meaningful size.

Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.  

Published in:

IBM Journal of Research and Development  (Volume:31 ,  Issue: 2 )