SearcharxivSearch

arXiv subjects

A. Zenchuk

Publications and source records attributed to A. Zenchuk.

2 recordsLinked to original sources

Analytical analysis of ground states on 0-$π$ long Josephson junctions

We investigate analytically a long Josephson 0-$π$-junction with several 0 and $π$ facets which are comparable to the Josephson penetration length $λ_J$. Such junctions can be fabricated exploiting (a) the d-wave order parameter symmetry of cuprate superconductors; (b) the spacial oscillations of the order parameter in superconductor-insulator-ferromagnet-superconductor structures with different thicknesses of ferromagnetic layer to produce 0 or $π$ coupling or (c) the structure of the corresponding sine-Gordon equations and substituting the phase $π$-discontinuities by the artificial current injectors. We investigate analytically the possible ground states in such a system and show that there is a critical facet length $a_c$, which separates the states with half-integer flux quanta (semifluxons) from the trivial ``flat phase state'' without magnetic flux. We analyze different branches of the bifurcation diagram, derive a system of transcendental equations which can be effectively solved to find the crossover distance $a_c$ (bifurcation point) and present the solutions for different number of facets and the edge facets length. We show that the edge facets may drastically affect the state of the system.

nlin.PS

Parallel Implementations of the Split-Step Fourier Method for Solving Nonlinear Schrödinger Systems

We present a parallel version of the well-known Split-Step Fourier method (SSF) for solving the Nonlinear Schrödinger equation, a mathematical model describing wave packet propagation in fiber optic lines. The algorithm is implemented under both distributed and shared memory programming paradigms on the Silicon Graphics/Cray Research Origin 200. The 1D Fast-Fourier Transform (FFT) is parallelized by writing the 1D FFT as a 2D matrix and performing independent 1D sequential FFTs on the rows and columns of this matrix. We can attain almost perfect speedup in SSF for small numbers of processors depending on both problem size and communication contention. The parallel algorithm is applicable to other computational problems constrained by the speed of the 1D FFT.

physics.comp-ph