相关论文: Relaxation algorithm in description of superconduc…
Usually, the relaxation times of a gas are estimated in the frame of the Boltzmann equation. In this paper, instead, we deal with the relaxation problem in the frame of the dynamical theory of Hamiltonian systems, in which the definition…
The local relaxation algorithm is promising for fast solution of Poisson's equations, which computes the electric field distribution in a stepwise manner via local curl-free updates while strictly enforcing Gauss's law. We propose a novel…
This paper proposes a bilevel hierarchy of strengthened complex moment relaxations for complex polynomial optimization. The key trick entails considering a class of positive semidefinite conditions that arise naturally in characterizing the…
This work addresses the imposition of outflow boundary conditions for one-dimensional conservation laws. While a highly accurate numerical solution can be obtained in the interior of the domain, boundary discretization can lead to…
Travel time tomography is used to infer the underlying three-dimensional wavespeed structure of the Earth by fitting seismic travel time data collected at surface stations. Data interpolation and denoising techniques are important…
Lagrangian Relaxation (LR) is a powerful technique for solving large-scale Mixed Integer Linear Programming (MILP), particularly those with decomposable structures, such as vehicle routing or unit commitment problems. By relaxing the…
A junction is a particular network given by the collection of $N\ge 1$ half lines $[0,+\infty)$ glued together at the origin. On such a junction, we consider evolutive Hamilton-Jacobi equations with $N$ coercive Hamiltonians. Furthermore,we…
A procedure to derive the Ginzburg-Landau (GL) theory from the multiband BCS Hamiltonian is developed in a general case with an arbitrary number of bands and arbitrary interaction matrix. It combines the standard Gor'kov truncation and a…
We propose a relaxation time approximation for the description of the dynamics of strongly excited fermion systems. Our approach is based on time-dependent density functional theory at the level of the local density approximation. This…
Patch-based relaxation refers to a family of methods for solving linear systems which partitions the matrix into smaller pieces often corresponding to groups of adjacent degrees of freedom residing within patches of the computational…
We investigate equilibration processes shortly after sudden perturbations are applied to ultracold trapped superfluids. We show the similarity of phase imprinting and localized density depletion perturbations, both of which initially are…
Jain's iterative rounding theorem is a well-known result in the area of approximation algorithms and, more broadly, in combinatorial optimization. The theorem asserts that LP relaxations of several problems in network design and…
Near isometric orthogonal embeddings to lower dimensions are a fundamental tool in data science and machine learning. In this paper, we present the construction of such embeddings that minimizes the maximum distortion for a given set of…
When a physical system is modeled by a nonlinear function, the unknown parameters can be estimated by fitting experimental observations by a least-squares approach. Newton's method and its variants are often used to solve problems of this…
We present a complexity reduction algorithm for a family of parameter-dependent linear systems when the system parameters belong to a compact semi-algebraic set. This algorithm potentially describes the underlying dynamical system with…
We propose a finite-difference algorithm for solving the time-dependent Ginzburg-Landau (TDGL) equation coupled to the appropriate Maxwell equation. The time derivatives are discretized using a second order semi-implicit scheme which, for…
This paper proposes a general fixture layout design framework that directly integrates the system equation with the convex relaxation method. Note that the optimal fixture design problem is a large-scale combinatorial optimization problem,…
The mixed state of superconducting (SC) and normal (N) phases in one dimensional systems are characterized by several phase slips and localization of the order parameter of the SC phase. The phenomenon is explained on the basis of a complex…
We propose a simple O([n^5/\log n]L) algorithm for linear programming feasibility, that can be considered as a polynomial-time implementation of the relaxation method. Our work draws from Chubanov's "Divide-and-Conquer" algorithm [4], where…
A new discrete model for energy relaxation of a quantum particle is described via a projection operator, causing the wave function collapse. Power laws for the evolution of the particle coordinate and momentum dispersions are derived. A new…