An algorithm to calculate the transport exponent in strip geometries

B. Derrida; B. Derrida; B. Derrida; D. Frank; D. Gingold; D. J. Bergman; E. Stoll; F. Babalievski; F. Babalievski; F. Babalievski; F. Babalievski; G. G. Batrouni; G. G. Batrouni; H. J. Herrmann; H. Nakanishi; J. Adler; J. Hoshen; J. Normand; K. Wu; M. P. Nightingale; R. A. Monetti; R. Edwards; R. Tarjan; S. Roux; S. Roux; T. Vicsek

research

An algorithm to calculate the transport exponent in strip geometries

Authors: B. Derrida
B. Derrida
B. Derrida
D. Frank
D. Gingold
D. J. Bergman
E. Stoll
F. Babalievski
F. Babalievski
F. Babalievski
F. Babalievski
G. G. Batrouni
G. G. Batrouni
H. J. Herrmann
H. Nakanishi
J. Adler
J. Hoshen
J. Normand
K. Wu
M. P. Nightingale
R. A. Monetti
R. Edwards
R. Tarjan
S. Roux
S. Roux
T. Vicsek
Publication date: 22 September 1994
Publisher: 'American Physical Society (APS)'
Doi

Abstract

An algorithm for solving the random resistor problem by means of the transfer-matrix approach is presented. Preconditioning by spanning clusters extraction both reduces the size of the conductivity matrix and speed up the calculations.Comment: 17 pages, RevTeX2.1, HLRZ - 97/9

Similar works

Full text

Available Versions

Crossref

info:doi/10.1103%2Fphysreve.51...

Last time updated on 02/01/2020