Monte Carlo Algorithm for the Double Exchange Model Optimized for Parallel Computations

Preprint

15 March 2001

preprint
Published by arXiv in arXiv

https://doi.org/10.48550/arXiv.cond-mat/0103316

Abstract

A new algorithm for Monte Carlo calculation of the double exchange model is studied. The algorithm is commonly applicable to wide classes of strongly correlated electron systems which involve itinerant electrons coupled with thermodynamically fluctuating fields. Using moment expansions of the density of states with Chebyshev polynomials, the algorithm provides an efficient calculation on large size clusters, especially on parallel computers. Benchmark calculations are performed on Beowulf-type cluster systems with over 100 CPUs in parallel.

Keywords

OPTIMIZED FOR PARALLEL
DOUBLE EXCHANGE MODEL
PARALLEL COMPUTERS
DENSITY OF STATES
MODEL OPTIMIZED
EXCHANGE MODEL
MONTE CARLO
ALGORITHM
BEOWULF

All Related Versions

Version 1, 2001-03-15, ArXiv
Published version: Computer Physics Communications, 142 (1-3), 410.

This publication has 0 references indexed in Scilit: