Fast algorithms for triangular Josephson junction arrays (Q1357341)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1019300
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast algorithms for triangular Josephson junction arrays |
scientific article; zbMATH DE number 1019300 |
Statements
Fast algorithms for triangular Josephson junction arrays (English)
0 references
1997
0 references
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.
0 references
fast algorithms
0 references
Josephson junction arrays
0 references
0.6988183259963989
0 references
0.6869138479232788
0 references
0.6804962158203125
0 references
0.6732496023178101
0 references
