Fast algorithms for triangular Josephson junction arrays

DOI10.1006/JCPH.1996.5620MaRDI QIDQ1357341zbMATH OpenOpenAlexFDO

Authors Sujay Datta, Deshdeep Sahdev

Publication date 1997

Published in Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jcph.1996.5620

zbMATH Keywords

fast algorithmsJosephson junction arrays

Mathematics Subject Classification ID

Applications to the sciences (65Z05)

Review text

This paper develops fast algorithms for the numerical study of two-dimensional Josephson junction arrays. The arrays are triangular and they can have both hexagonal and rectangular periodicity. Algorithms are developed for each of these. Boundaries are included and algorithms developed for these. The essential idea is to find a basis that is related to the position basis by a fast transform and which also completely (or almost completely) diagonalizes some of the matrices.

Recommendations

• Mapping of one-dimensional Josephson junction arrays onto cellular neural networks and their dynamics
• Finite element simulations of window Josephson junctions
• Numerical Solution of a Class of Boundary Value Problems Arising in the Physics of Josephson Junctions
• Single waveform solutions for linear arrays of Josephson junctions

Cites work

• scientific article; zbMATH DE number 3131829 (Why is no real title available?)
• scientific article; zbMATH DE number 3942888 (Why is no real title available?)
• scientific article; zbMATH DE number 3186688 (Why is no real title available?)
• The dynamical response of a three-junction network. I: Phase variables
• The dynamical response of a three-junction network. II: Vortices

Cited in

(1)

• scientific article; zbMATH DE number 4045092 (Why is no real title available?)

This page was built for publication: Fast algorithms for triangular Josephson junction arrays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1357341)