Related papers: Damping factors for the gap-tooth scheme
Efficient computation of min-max problems is a central question in optimization, learning, games, and controls. Arguably the most natural algorithm is gradient-descent-ascent (GDA). However, since the 1970s, conventional wisdom has argued…
A microscopic heterogeneous system under random influence is considered. The randomness enters the system at physical boundary of small scale obstacles as well as at the interior of the physical medium. This system is modeled by a…
We consider the simulation of barotropic flow of gas in long pipes and pipe networks. Based on a Hamiltonian reformulation of the governing system, a fully discrete approximation scheme is proposed using mixed finite elements in space and…
We deal with an initial-boundary value problem for the multidimensional acoustic wave equation, with the variable speed of sound. For a three-level semi-explicit in time higher-order vector compact scheme, we prove stability and derive 4th…
Markov decision processes (MDPs) are a canonical model to reason about decision making within a stochastic environment. We study a fundamental class of infinite MDPs: one-counter MDPs (OC-MDPs). They extend finite MDPs via an associated…
This work concerns the minimization of the pseudospectral abscissa of a matrix-valued function dependent on parameters analytically. The problem is motivated by robust stability and transient behavior considerations for a linear control…
It is shown how the phase-damping master equation, either in Markovian and nonMarkovian regimes, can be obtained as an averaged random unitary evolution. This, apart from offering a common mathematical setup for both regimes, enables us to…
The existence and uniqueness of weak solutions to dynamical low-rank evolution problems for parabolic partial differential equations in two spatial dimensions is shown, covering also non-diagonal diffusion in the elliptic part. The proof is…
We construct a new compact semi-explicit three-level in time fourth-order finite-difference scheme for numerical solving the general multidimensional acoustic wave equation, where both the speed of sound and density of a medium are…
We present a novel local improvement scheme for the perfectly balanced graph partitioning problem. This scheme encodes local searches that are not restricted to a balance constraint into a model allowing us to find combinations of these…
The recent implementation of a swap Monte Carlo algorithm (SWAP) for polydisperse mixtures fully bypasses computational sluggishness and closes the gap between experimental and simulation timescales in physical dimensions $d=2$ and $3$.…
In this paper, a two-dimensional incompressible miscible displacement model is considered, and a novel decoupled and linearized high-order finite difference scheme is developed, by utilizing the multi-time-step strategy to treat the…
In this paper, we study temporal splitting algorithms for multiscale problems. The exact fine-grid spatial problems typically require some reduction in degrees of freedom. Multiscale algorithms are designed to represent the fine-scale…
We present a strategy for solving time-dependent problems on grids with local refinements in time using different time steps in different regions of space. We discuss and analyze two conservative approximations based on finite volume with…
We study a fixed step-size noisy distributed gradient descent algorithm for solving optimization problems in which the objective is a finite sum of smooth but possibly non-convex functions. Random perturbations are introduced to the…
This paper studies iterative schemes for measure transfer and approximation problems, which are defined through a slicing-and-matching procedure. Similar to the sliced Wasserstein distance, these schemes benefit from the availability of…
State space models have long played an important role in signal processing. The Gaussian case can be treated algorithmically using the famous Kalman filter. Similarly since the 1970s there has been extensive application of Hidden Markov…
We revisit the classic Pandora's Box (PB) problem under correlated distributions on the box values. Recent work of arXiv:1911.01632 obtained constant approximate algorithms for a restricted class of policies for the problem that visit boxes…
Motion planning under differential constraints is a classic problem in robotics. To date, the state of the art is represented by sampling-based techniques, with the Rapidly-exploring Random Tree algorithm as a leading example. Yet, the…
We prove an optimal $\Omega(n)$ lower bound on the randomized communication complexity of the much-studied Gap-Hamming-Distance problem. As a consequence, we obtain essentially optimal multi-pass space lower bounds in the data stream model…