Efficient implementation of the Lanczos method for magnetic systems
Journal Article
·
· Journal of Computational Physics
- Universitaet Bielefeld, Fakultaet fuer Physik, Postfach 100131, D-33501 Bielefeld (Germany)
- Universitaet Osnabrueck, Fachbereich Physik, D-49069 Osnabrueck (Germany)
Numerically exact investigations of interacting spin systems provide a major tool for an understanding of their magnetic properties. For medium size systems the approximate Lanczos diagonalization is the most common method. In this article we suggest two improvements: efficient basis coding in subspaces and simple restructuring for openMP parallelization.
- OSTI ID:
- 21159424
- Journal Information:
- Journal of Computational Physics, Vol. 227, Issue 9; Other Information: DOI: 10.1016/j.jcp.2008.01.027; PII: S0021-9991(08)00033-8; Copyright (c) 2008 Elsevier Science B.V., Amsterdam, The Netherlands, All rights reserved; Country of input: International Atomic Energy Agency (IAEA); ISSN 0021-9991
- Country of Publication:
- United States
- Language:
- English
Similar Records
Implementation of the Lanczos algorithm for the Hubbard model on the Connection Machine system
Lanczos diagonalizations of the 1-D Peierls-Hubbard model
Comparison of Lanczos and subspace iterations for hyperspherical reaction path calculations
Journal Article
·
Sun Nov 01 00:00:00 EST 1992
· Computers in Physics; (United States)
·
OSTI ID:21159424
Lanczos diagonalizations of the 1-D Peierls-Hubbard model
Conference
·
Sun Jan 01 00:00:00 EST 1989
·
OSTI ID:21159424
Comparison of Lanczos and subspace iterations for hyperspherical reaction path calculations
Conference
·
Fri Jan 01 00:00:00 EST 1988
·
OSTI ID:21159424
+1 more