FAST ALGORITHMS FOR TRIANGULAR JOSEPHSON-JUNCTION ARRAYS

Authors
DATTA S SAHDEV D
Citation
S. Datta et D. Sahdev, FAST ALGORITHMS FOR TRIANGULAR JOSEPHSON-JUNCTION ARRAYS, Journal of computational physics, 132(2), 1997, pp. 276-284
Citations number
44
Categorie Soggetti
Mathematical Method, Physical Science","Computer Science Interdisciplinary Applications","Physycs, Mathematical
Journal title
Journal of computational physics → ACNP
ISSN journal
00219991
Volume
132
Issue
2
Year of publication
1997
Pages
276 - 284
Database
ISI
SICI code
0021-9991(1997)132:2<276:FAFTJA>2.0.ZU;2-N
Abstract
We develop fast algorithms for the numerical study of two-dimensional triangular Josephson junction arrays. The Dirac bra-ket formalism is i ntroduced in the context of such arrays. We note that triangular array s can have both hexagonal and rectangular periodicity and develop algo rithms for each. Boundaries are next introduced and fast algorithms fo r finite arrays are developed. (C) 1997 Academic Press.