An out-of-core high-resolution FFT algorithm for determining large-scale imperfections of surface potentials in crystals

M. Bakhos; A. P. Vincent; David A Yuen

doi:10.1016/j.cpc.2005.02.003

An out-of-core high-resolution FFT algorithm for determining large-scale imperfections of surface potentials in crystals

M. Bakhos, A. P. Vincent, David A Yuen

Earth and Environmental Sciences-Twin Cities

Research output: Contribution to journal › Article › peer-review

Abstract

We present a simple out-of-core algorithm for computing the Fast-Fourier Transform (FFT) needed to determine the two-dimensional potential of surface crystals with large-scale features, like faults, at ultra-high resolution, with around 10⁹ grid points. This algorithm represents a proof of concept that a simple and easy-to-code, out-of-core algorithm can be easily implemented and used to solve large-scale problems on low-cost hardware. The main novelties of our algorithm are: (1) elapsed and I/O times decrease with the number of single records (lines) being read; (2) only basic reading and writing routines is necessary for making the out-of-core access. Our method can be easily extended to 3D and be applied to many grand-challenge problems in science and engineering, such as fluid dynamics.

Original language	English (US)
Pages (from-to)	198-208
Number of pages	11
Journal	Computer Physics Communications
Volume	168
Issue number	3
DOIs	https://doi.org/10.1016/j.cpc.2005.02.003
State	Published - Jun 15 2005

Bibliographical note

Funding Information:
We thank Paul Woodward for stimulating comments and access to the Power Wall at L.C.S.E., which has helped us to visualize the large-scale features. Renata Wentzcovitch for encouragement and Taku and Jun Tsuchiya for discussion. We thank the CCP4 team for having allowed us to look at their software. We thank Maxwell Rudolph, Erik O.D. Sevre, Ben F. Kadlec, Cesar da Silva and Evan Bollig for help in setting up the Opteron system. This search has been supported by CRSNG Canada (A.P. Vincent) and National Science Foundation (David Yuen).

Copyright:
Copyright 2008 Elsevier B.V., All rights reserved.

Keywords

Crystal lattice
Out-of-core FFT
Poisson equation

Access

10.1016/j.cpc.2005.02.003

OpenUrl availability

Full text

Cite this

@article{a3599fef5b0f4672952c25ce88223c74,

title = "An out-of-core high-resolution FFT algorithm for determining large-scale imperfections of surface potentials in crystals",

abstract = "We present a simple out-of-core algorithm for computing the Fast-Fourier Transform (FFT) needed to determine the two-dimensional potential of surface crystals with large-scale features, like faults, at ultra-high resolution, with around 109 grid points. This algorithm represents a proof of concept that a simple and easy-to-code, out-of-core algorithm can be easily implemented and used to solve large-scale problems on low-cost hardware. The main novelties of our algorithm are: (1) elapsed and I/O times decrease with the number of single records (lines) being read; (2) only basic reading and writing routines is necessary for making the out-of-core access. Our method can be easily extended to 3D and be applied to many grand-challenge problems in science and engineering, such as fluid dynamics.",

keywords = "Crystal lattice, Out-of-core FFT, Poisson equation",

author = "M. Bakhos and Vincent, {A. P.} and Yuen, {David A}",

note = "Funding Information: We thank Paul Woodward for stimulating comments and access to the Power Wall at L.C.S.E., which has helped us to visualize the large-scale features. Renata Wentzcovitch for encouragement and Taku and Jun Tsuchiya for discussion. We thank the CCP4 team for having allowed us to look at their software. We thank Maxwell Rudolph, Erik O.D. Sevre, Ben F. Kadlec, Cesar da Silva and Evan Bollig for help in setting up the Opteron system. This search has been supported by CRSNG Canada (A.P. Vincent) and National Science Foundation (David Yuen). Copyright: Copyright 2008 Elsevier B.V., All rights reserved.",

year = "2005",

month = jun,

day = "15",

doi = "10.1016/j.cpc.2005.02.003",

language = "English (US)",

volume = "168",

pages = "198--208",

journal = "Computer Physics Communications",

issn = "0010-4655",

publisher = "Elsevier",

number = "3",

}

TY - JOUR

T1 - An out-of-core high-resolution FFT algorithm for determining large-scale imperfections of surface potentials in crystals

AU - Bakhos, M.

AU - Vincent, A. P.

AU - Yuen, David A

N1 - Funding Information: We thank Paul Woodward for stimulating comments and access to the Power Wall at L.C.S.E., which has helped us to visualize the large-scale features. Renata Wentzcovitch for encouragement and Taku and Jun Tsuchiya for discussion. We thank the CCP4 team for having allowed us to look at their software. We thank Maxwell Rudolph, Erik O.D. Sevre, Ben F. Kadlec, Cesar da Silva and Evan Bollig for help in setting up the Opteron system. This search has been supported by CRSNG Canada (A.P. Vincent) and National Science Foundation (David Yuen). Copyright: Copyright 2008 Elsevier B.V., All rights reserved.

PY - 2005/6/15

Y1 - 2005/6/15

N2 - We present a simple out-of-core algorithm for computing the Fast-Fourier Transform (FFT) needed to determine the two-dimensional potential of surface crystals with large-scale features, like faults, at ultra-high resolution, with around 109 grid points. This algorithm represents a proof of concept that a simple and easy-to-code, out-of-core algorithm can be easily implemented and used to solve large-scale problems on low-cost hardware. The main novelties of our algorithm are: (1) elapsed and I/O times decrease with the number of single records (lines) being read; (2) only basic reading and writing routines is necessary for making the out-of-core access. Our method can be easily extended to 3D and be applied to many grand-challenge problems in science and engineering, such as fluid dynamics.

AB - We present a simple out-of-core algorithm for computing the Fast-Fourier Transform (FFT) needed to determine the two-dimensional potential of surface crystals with large-scale features, like faults, at ultra-high resolution, with around 109 grid points. This algorithm represents a proof of concept that a simple and easy-to-code, out-of-core algorithm can be easily implemented and used to solve large-scale problems on low-cost hardware. The main novelties of our algorithm are: (1) elapsed and I/O times decrease with the number of single records (lines) being read; (2) only basic reading and writing routines is necessary for making the out-of-core access. Our method can be easily extended to 3D and be applied to many grand-challenge problems in science and engineering, such as fluid dynamics.

KW - Crystal lattice

KW - Out-of-core FFT

KW - Poisson equation

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

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

U2 - 10.1016/j.cpc.2005.02.003

DO - 10.1016/j.cpc.2005.02.003

M3 - Article

AN - SCOPUS:19044381978

SN - 0010-4655

VL - 168

SP - 198

EP - 208

JO - Computer Physics Communications

JF - Computer Physics Communications

IS - 3

ER -

An out-of-core high-resolution FFT algorithm for determining large-scale imperfections of surface potentials in crystals

Abstract

Bibliographical note

Keywords

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this