相关论文: Relaxation algorithm in description of superconduc…

Various superconducting lattices were simulated and can be treated as lattices of superconducting atoms with preimposed symmetry in 1, 2 and 3 dimensions. Hybrid Schroedinger-Ginzburg-Landau approach is based on the fact of the mathematical…

Ginzburg-Landau (GL) equations and GL free energy for flux phase and superconductivity are derived microscopically from the $t-J$ model on a square lattice. Order parameter (OP) for the flux phase has direct coupling to a magnetic field, in…

We will describe a new superconductivity mechanism, proposed by the authors in [1], which is based on a topologically ordered ground state rather than on the usual Landau mechanism of spontaneous symmetry breaking. Contrary to anyon…

We perform an analytical and numerical study of the crossover from the Josephson effect to the bulk superconducting flow for two identical one-dimensional superconductors, co-existing with a layer of normal material. A generalized…

The Scheduled Relaxation Jacobi (SRJ) method is an extension of the classical Jacobi iterative method to solve linear systems of equations ($Au=b$) associated with elliptic problems. It inherits its robustness and accelerates its…

We present the theoretical approach to study the unconventional Josephson junction (uJJ) made by putting the non-superconduncting strip on the top of superconducting strip. We work in the framework of the Ginzburg-Landau, Bogoliubov de…

The importance of simulating pinning arrays in superconducting samples for the increase of critical currents has been increasing in the last few years. Since the Time Dependent Ginzburg Landau (TDGL) can be more accurate than alternative…

Ab initio atomic relaxations often take large numbers of steps and long times to converge. An atomic relaxation method based on on-the-flight force learning and a corresponding new curved line minimization algorithm is presented to…

This article is concerned with the integration of the time-dependent Ginzburg--Landau (TDGL) equations of superconductivity. Four algorithms, ranging from fully explicit to fully implicit, are presented and evaluated for stability,…

This article is concerned with the integration of the time-dependent Ginzburg-Landau (TDGL) equations of superconductivity. Four algorithms, ranging from fully explicit to fully implicit, are presented and evaluated for stability, accuracy,…

Landauer's formula is the standard theoretical tool to examine ballistic transport in nano- and meso-scale junctions, but it necessitates that any variation of the junction with time must be slow compared to characteristic times of the…

Here we describe a development of computer algorithm to simulate the Time Dependent Ginzburg-Landau equation (TDGL) and its application to understand superconducting vortex dynamics in confined geometries. Our initial motivation to get…

We study the localized stationary solutions of the one-dimensional time-dependent Ginzburg-Landau equations in the presence of a current. These threshold perturbations separate undercritical perturbations which return to the normal phase…

We present a novel method for solving square jigsaw puzzles based on global optimization. The method is fully automatic, assumes no prior information, and can handle puzzles with known or unknown piece orientation. At the core of the…

Dual decomposition, and more generally Lagrangian relaxation, is a classical method for combinatorial optimization; it has recently been applied to several inference problems in natural language processing (NLP). This tutorial gives an…

The critical dynamics of superconductors in the charged regime is reconsidered within field-theory. For the dynamics the Ginzburg-Landau model with complex order parameter coupled to the gauge field suggested earlier [Lannert et al. Phys.…

We propose a novel Linear Program (LP) based formula- tion for solving jigsaw puzzles. We formulate jigsaw solving as a set of successive global convex relaxations of the stan- dard NP-hard formulation, that can describe both jigsaws with…

Motivated by nonconvex, inconsistent feasibility problems in imaging, the relaxed alternating averaged reflections algorithm, or relaxed Douglas-Rachford algorithm (DR$\lambda$), was first proposed over a decade ago. Convergence results for…

We report on a "source-sink" algorithm which allows one to calculate time-resolved physical quantities from a general nanoelectronic quantum system (described by an arbitrary time-dependent quadratic Hamiltonian) connected to infinite…

During the last decade, Neural Networks (NNs) have proved to be extremely effective tools in many fields of engineering, including autonomous vehicles, medical diagnosis and search engines, and even in art creation. Indeed, NNs often…