TY - JOUR
T1 - Calculating large systems with plane waves
T2 - Is it a N3 or N2 scaling problem?
AU - Troullier, N.
AU - Chelikowsky, James R.
AU - Saad, Y.
PY - 1995/1
Y1 - 1995/1
N2 - It is commonly asserted that in performing large scale plane wave calculations with N plane waves, and indirect diagonalization, the N3 orthogonalization step quickly becomes the limiting factor. Using a pre-condition Lanczos subspace diagonalization algorithm we find that while the orthogonalization will eventually become the dominate cpu restriction, this is not the limiting factor. Typically the limitation resides not with the cpu, but with the memory limitations of the current computer systems. The memory needed to store the wave functions scales as Natom2. This scaling "limitation" is reached before the cpu time becomes the dominate factor. We illustrate this scaling with a Na vacancy calculation using up to 2000 atoms.
AB - It is commonly asserted that in performing large scale plane wave calculations with N plane waves, and indirect diagonalization, the N3 orthogonalization step quickly becomes the limiting factor. Using a pre-condition Lanczos subspace diagonalization algorithm we find that while the orthogonalization will eventually become the dominate cpu restriction, this is not the limiting factor. Typically the limitation resides not with the cpu, but with the memory limitations of the current computer systems. The memory needed to store the wave functions scales as Natom2. This scaling "limitation" is reached before the cpu time becomes the dominate factor. We illustrate this scaling with a Na vacancy calculation using up to 2000 atoms.
UR - http://www.scopus.com/inward/record.url?scp=0029220852&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0029220852&partnerID=8YFLogxK
U2 - 10.1016/0038-1098(94)00688-1
DO - 10.1016/0038-1098(94)00688-1
M3 - Article
AN - SCOPUS:0029220852
SN - 0038-1098
VL - 93
SP - 225
EP - 230
JO - Solid State Communications
JF - Solid State Communications
IS - 3
ER -