This communication presents a simple algorithm to compute the stiffness matrix for a triangular plate bending element, without numerical integration. This brings about a substantial saving in computer time.
Fast Algorithms for Triangular Josephson Junction Arrays
โ Scribed by Sujay Datta; Deshdeep Sahdev
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 375 KB
- Volume
- 132
- Category
- Article
- ISSN
- 0021-9991
No coin nor oath required. For personal study only.
โฆ Synopsis
vortices, as quantum objects, can interfere constructively or destructively after following two different paths enclosing a
We develop fast algorithms for the numerical study of two-dimensional triangular Josephson junction arrays. The Dirac bra-ket for-charge placed at the center of the hexagon [21]. The ground malism is introduced in the context of such arrays. We note that state configuration of triangular arrays under the applicatriangular arrays can have both hexagonal and rectangular periodiction of an external magnetic field has unique features of ity and develop algorithms for each. Boundaries are next introduced its own. For example, domain wall superlattices [22] occur and fast algorithms for finite arrays are developed. แฎ 1997 Acaat characteristic values of f, the quantum of magnetic flux demic Press threading a plaquette, and there is an accidental degeneracy of the ground state [23] for f ฯญ and . In fact, there 276
๐ SIMILAR VOLUMES
## Abstract A novel method based on a combination of genetic algorithm (GA) and fast Fourier transform (FFT) is developed to synthesize antenna arrays. Compared with the synthesis method using GA in an angle domain, it can calculate more quickly while maintaining the same precision. Simulation resu
The analysis of radiation and scattering from a multiregion ( ) quasiplanar structure using the conยจentional method of moments MoM is computationally expensiยจe. To circumยจent this difficulty, a computational scheme that supplements the classical MoM with the steepest descent fast-multipole algorithm