Abstract
We develop fast algorithms for the numerical study of two-dimensional triangular Josephson junction arrays. The Dirac bra-ket formalism is introduced in the context of such arrays. We note that triangular arrays can have both hexagonal and rectangular periodicity and develop algorithms for each. Boundaries are next introduced and fast algorithms for finite arrays are developed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
