CALCULATING LARGE SYSTEMS WITH PLANE-WAVES - IS IT A N-3 OR N-2 SCALING PROBLEM

Citation
N. Troullier et al., CALCULATING LARGE SYSTEMS WITH PLANE-WAVES - IS IT A N-3 OR N-2 SCALING PROBLEM, Solid state communications, 93(3), 1995, pp. 225-230
Citations number
31
Categorie Soggetti
Physics, Condensed Matter
Journal title
ISSN journal
00381098
Volume
93
Issue
3
Year of publication
1995
Pages
225 - 230
Database
ISI
SICI code
0038-1098(1995)93:3<225:CLSWP->2.0.ZU;2-E
Abstract
It is commonly asserted that in performing large scale plane wave calc ulations with N plane waves, and indirect diagnolization, the N3 ortho gonalization step quickly becomes the limiting factor. Using a pre-con dition Lanczos subspace diagnolization algorithm we find that while th e orthogonalization will eventually become the dominate cpu restrictio n, this is not the limiting factor. Typically the limitation resides n ot with the cpu, but with the memory limitations of the functions scal es as N(atom)2. 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.