Related papers: Relaxation algorithm in description of superconduc…
A new algorithm for time dependent Hamilton Jacobi equations on networks, based on semi Lagrangian scheme, is proposed. It is based on the definition of viscosity solution for this kind of problems recently given in. A thorough convergence…
We consider single-source shortest path algorithms that perform a sequence of relaxation steps whose ordering depends only on the input graph structure and not on its weights or the results of prior steps. Each step examines one edge of the…
Open-system approaches are gaining traction in the simulation of charge transport in nanoscale and molecular electronic devices. In particular, "extended reservoir" simulations, where explicit reservoir degrees of freedom are present, allow…
We consider a class of optimal power flow (OPF) applications where some loads offer a modulation service in exchange for an activation fee. These applications can be modeled as multi-period formulations of the OPF with discrete variables…
The control of relaxation-type systems of ordinary differential equations is investigated using the Hamilton-Jacobi-Bellman equation. First, we recast the model as a singularly perturbed dynamics which we embed in a family of controlled…
This article presents an arithmetic, called superposition relaxation, for bracketing the graph of a multivariate factorable function on a compact domain between a pair of underestimating and overestimating functions that are both separable.…
We study the relaxation mechanism of a highly excited carrier propagating in the antiferromagnetic background modeled by the $t$-$J$ Hamiltonian on a square lattice. We show that the relaxation consists of two distinct stages. The initial…
Combinatorial problems are formulated to find optimal designs within a fixed set of constraints. They are commonly found across diverse engineering and scientific domains. Understanding how to best use quantum computers for combinatorial…
The Johnson--Lindenstrauss (JL) lemma is a powerful tool for dimensionality reduction in modern algorithm design. The lemma states that any set of high-dimensional points in a Euclidean space can be flattened to lower dimensions while…
In the design and investigation of superconducting qubits and related devices, a lumped element circuit model is the standard theoretical approach. However, many important physical questions lie beyond its scope, e.g. the behavior of…
An overrelaxed variant of simulated annealing is applied to the problem of maximally abelian gauge fixing. The superiority of this algorithm over the commonly used relaxation procedure is demonstrated. Biases on non gauge invariant…
We elaborate on boundary conditions for Ginzburg-Landau (GL) theory in the case of external currents. We implement a self-consistent theory within the finite element method (FEM) and present numerical results for a two-dimensional…
We develop a fractional-order Ginzburg-Landau (GL) framework for nonreciprocal superconducting transport in Josephson junctions formed by fractal superconductors or superconducting media with nonlocal correlations, separated by a…
This paper concerns a first-order algorithmic technique for a class of optimal control problems defined on switched-mode hybrid systems. The salient feature of the algorithm is that it avoids the computation of Fr\'echet or G\^ateaux…
We present a simplified and unified analysis of the Johnson-Lindenstrauss (JL) lemma, a cornerstone of dimensionality reduction for managing high-dimensional data. Our approach simplifies understanding and unifies various constructions…
In this paper we present a new ultra efficient numerical method for solving kinetic equations. In this preliminary work, we present the scheme in the case of the BGK relaxation operator. The scheme, being based on a splitting technique…
Sequential lateration is a class of methods for multidimensional scaling where a suitable subset of nodes is first embedded by some method, e.g., a clique embedded by classical scaling, and then the remaining nodes are recursively embedded…
In this work, we introduce new methods for the quantization, decomposition, and extraction (from electromagnetic simulations) of lumped-element circuit models for superconducting quantum devices. Our flux-charge symmetric procedures center…
This work is a further development of an approach to the description of relaxation processes in complex systems on the basis of the p-adic analysis. We show that three types of relaxation fitted into the Kohlrausch-Williams-Watts law, the…
Hybrid dynamical systems have proven to be a powerful modeling abstraction, yet fundamental questions regarding the dynamical properties of these systems remain. In this paper, we develop a novel class of relaxations which we use to recover…