相关论文: Perturbation of transportation polytopes
This dissertation investigates the geometric combinatorics of convex polytopes and connections to the behavior of the simplex method for linear programming. We focus our attention on transportation polytopes, which are sets of all tables of…
We formulate and solve a class of finite-time transport and mixing problems in the set-oriented framework. The aim is to obtain optimal discrete-time perturbations in nonlinear dynamical systems to transport a specified initial measure on…
This paper discusses properties of the graphs of 2-way and 3-way transportation polytopes, in particular, their possible numbers of vertices and their diameters. Our main results include a quadratic bound on the diameter of axial 3-way…
We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…
The perturbation method is applied to numerical solution of the Lane-Emden Equation of arbitrary index n, and the global parameters of polytropes are found as function of polytropic index n.
Performing both right and left multiplication operations using general regular matrix polynomials, which need not be monic and may possess leading coefficients of arbitrary rank, on a rectangular matrix of measures associated with mixed…
We propose an efficient procedure to obtain Green's functions by combining the shifted conjugate orthogonal conjugate gradient (shifted COCG) method with the nonequilibrium Green's function (NEGF) method based on a real-space…
We prove that any mixed-integer linear extended formulation for the matching polytope of the complete graph on $n$ vertices, with a polynomial number of constraints, requires $\Omega(\sqrt{\sfrac{n}{\log n}})$ many integer variables. By…
We provide a systematic formula, in terms of integer partitions, that generates perturbation theory explicitly at an arbitrary order. Our approach naturally includes an infinite number of perturbations and uses a single matrix equation that…
In this thesis we showed that Non-equilibrium Green's Function Perturbation Theory (NEGF) is really the overarching perturbative transport theory. This is shown in great detail by using NEGF as a starting point and developing in 3…
In this paper, we study decoherence in Grover's quantum search algorithm using a perturbative method. We assume that each two-state system (qubit) that belongs to a register suffers a phase flip error (\sigma_{z} error) with probability p…
The problem of electron scattering on the one-dimensional complexes is considered. We propose a novel theoretical approach to solution of the transport problem for a quantum graph. In the frame of the developed approach the solution of the…
We consider the multidimensional Monge-Kantrovich transport problem in an abstract setting. Our main results state that if a cost function and marginal measures are invariant by a family of transformations, then a solution of the Kantrovich…
The recent first detection of gravitational waves (GWs) from binary black hole mergers has spurred a renewed interest in possible deviations from General Relativity (GR), since they could be detected in the GWs emitted by such systems. Of…
In optimal transport, quadratic regularization is a sparse alternative to entropic regularization: the solution measure tends to have small support. Computational experience suggests that the support decreases monotonically to the…
A degenerate perturbation $k\cdot p$ approach for effective mass calculations is implemented in the all-electron density functional theory (DFT) package WIEN2k. The accuracy is tested on major group IVA, IIIA-VA, and IIB-VIA semiconductor…
The aim of this work is to introduce several different volume computation methods of the graph polytope associated with various type of finite simple graphs. Among them, we obtained the recursive volume formula (RVF) that is fundamental and…
We present an entirely new geometric and probabilistic approach to synchronization of correspondences across multiple sets of objects or images. In particular, we present two algorithms: (1) Birkhoff-Riemannian L-BFGS for optimizing the…
This article introduces a new class of fast algorithms to approximate variational problems involving unbalanced optimal transport. While classical optimal transport considers only normalized probability distributions, it is important for…
Perturbative gadgets are general techniques for reducing many-body spin interactions to two-body ones using perturbation theory. This allows for potential realization of effective many-body interactions using more physically viable two-body…