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

A novel class of Runge-Kutta discontinuous Galerkin schemes for coupled systems of conservation laws in multiple space dimensions that are separated by a fixed sharp interface is introduced. The schemes are derived from a relaxation…

A new relaxion mechanism is proposed where a small electroweak scale is preferably selected earlier than the larger one due to a potential instability, which is different from previously proposed stopping mechanisms by either Hubble…

A novel higher order theory of relaxation of heat and viscosity is proposed based on corrections to the traditional treatment of the relativistic energy density. In the framework of generalized Bjorken scaling solution to accelerating…

The aim of this paper is to solve linear semidefinite programs arising from higher-order Lasserre relaxations of unconstrained binary quadratic optimization problems. For this we use an interior point method with a preconditioned conjugate…

Starting from the Maxwell-Juettner equilibrium distribution, we develop a relativistic lattice Boltzmann (LB) algorithm capable of handling ultrarelativistic systems with flat, but expanding, spacetimes. The algorithm is validated through…

We prove a general result demonstrating the power of Lagrangian relaxation in solving constrained maximization problems with arbitrary objective functions. This yields a unified approach for solving a wide class of {\em subset selection}…

Recently, an approach known as relaxation has been developed for preserving the correct evolution of a functional in the numerical solution of initial-value problems, using Runge-Kutta methods. We generalize this approach to multistep…

This paper considers the extreme type-II Ginzburg-Landau equations that model vortex patterns in superconductors. The nonlinear PDEs are solved using Newton's method, and properties of the Jacobian operator are highlighted. Specifically, it…

Coupled relaxation oscillators, realized via chemical or other means, can exhibit a multiplicity of steady states, characterized by spatial patterns resulting from lateral inhibition. We show that perturbation-initiated transformations…

In this paper, we provide the different types of bifurcation diagrams for a superconducting cylinder placed in a magnetic field along the direction of the axis of the cylinder. The computation is based on the numerical solutions of the…

The linear programming (LP) approach has a long history in the theory of approximate dynamic programming. When it comes to computation, however, the LP approach often suffers from poor scalability. In this work, we introduce a relaxed…

Interest in Josephson junctions (JJs) has increased rapidly in recent years not only because of their use in qubits and other quantum devices but also due to the unique physics supported by the JJs. The advent of various novel quantum…

This paper considers a Josephson Junction array with the geometry of a ladder and anisotropy in the Josephson couplings. The ground state problem for the ladder corresponds to the one for the one-dimensional chiral XY model in a two-fold…

We consider the time-dependent Ginzburg-Landau model of superconductivity in the presence of an electric current flowing through a two-dimensional wire. We show that when the current is sufficiently strong the solution converges in the…

We derive an a priori parameter range for overrelaxation of the Sinkhorn algorithm, which guarantees global convergence and a strictly faster asymptotic local convergence. Guided by the spectral analysis of the linearized problem we pursue…

Collocation boundary element methods for integral equations are easier to implement than Galerkin methods because the elements of the discretization matrix are given by lower-dimensional integrals. For that same reason, the matrix assembly…

I describe a simple algorithm for numerically finding the ground state and low-lying excited states of a quantum system. The algorithm is an adaptation of the relaxation method for solving Poisson's equation, and is fundamentally based on…

The Successive Over-Relaxation (SOR) method is a useful method for solving the sparse system of linear equations which arises from finite-difference discretization of the Poisson equation. Knowing the optimal value of the relaxation…

We construct an analytic solution for a one-parameter family of holographic superconductors in asymptotically Lifshitz spacetimes. We utilize this solution to explore various properties of the systems such as (1) the superfluid phase…

In this paper, we apply the Schwarz Waveform Relaxation (SWR) method to the one dimensional Schr{\"o}dinger equation with a general linear or a nonlinear potential. We propose a new algorithm for the Schr{\"o}dinger equation with time…