Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · 1997 · 72 citations · 49 references
ComputingComputer SciencePhysicsComputational PhysicsQuantum ComputingTheory Of ComputationComputational Quantum MechanicsElectron CorrelationMatrix ComputationQuantum AlgorithmsChebyshev Polynomial RepresentationChebyshev PolynomialsLinear Response TheoryNumerical Solution Of The Schrödinger EquationState Vector Formalism
An $O(N)$ algorithm is proposed for calculating linear response functions of noninteracting electrons. This algorithm is simple and suitable to parallel and vector computation. Since it avoids ${O(N}^{3})$ computational effort of matrix diagonalization, it requires only $O(N)$ computational efforts, where $N$ is the dimension of the state vector. The use of this $O(N)$ algorithm is very effective since, otherwise, we have to calculate a large number of eigenstates, i.e., the occupied one-electron states up to the Fermi energy and the unoccupied states with higher energy. The advantage of this method compared to the Chebyshev polynomial method recently developed by Wang and Zunger [L. W. Wang, Phys. Rev. B 49, 10 154 (1994); L. W. Wang and A. Zunger, Phys. Rev. Lett. 73, 1039 (1994)] is that our method can calculate linear response functions without any storage of huge state vectors on external storage.
49
Numerical recipes in Pascal: the art of scientific computing
Choice Reviews Online · 1990 · 11.9K citations
Correlated electrons in high-temperature superconductors
Elbio Dagotto · Reviews of Modern Physics · 1994 · 3.1K citations · Full text