Related papers: Dispersing Points on Intervals
We deal with the problem of separation of time-scales and filamentation in a linear drift-diffusion problem posed on the whole space $\mathbb{R}^2$. The passive scalar considered is stirred by an incompressible flow with radial symmetry. We…
The path-following scheme in [Loisel and Maxwell, SIAM J. Matrix Anal. Appl., 39-4 (2018), pp. 1726-1749] is adapted to efficiently calculate the dispersion relation curve for linear surface waves on an arbitrary vertical shear current.…
Many science and engineering applications involve solving a linear least-squares system formed from some field measurements. In the distributed cyber-physical systems (CPS), often each sensor node used for measurement only knows partial…
Distributed optimization is an important direction of research in modern optimization theory. Its applications include large scale machine learning, distributed signal processing and many others. The paper studies decentralized min-max…
In the maximum scatter traveling salesman problem the objective is to find a tour that maximizes the shortest distance between any two consecutive nodes. This model can be applied to manufacturing processes, particularly laser melting…
Boundary value problems for linear stationary dispersive equations of order $2l+1$, $l\in \mathbb{N}$ have been considered on finite intervals $(0,L)$. The existence and uniqueness of regular solutions have been established for general…
We propose an algorithm for distributed optimization over time-varying communication networks. Our algorithm uses an optimized ratio between the number of rounds of communication and gradient evaluations to achieve fast convergence. The…
We present a class of iterative fully distributed fixed point methods to solve a system of linear equations, such that each agent in the network holds one of the equations of the system. Under a generic directed, strongly connected network,…
We introduce diffusions on a space of interval partitions of the unit interval that are stationary with the Poisson-Dirichlet laws with parameters $(\alpha,0)$ and $(\alpha,\alpha)$. The construction has two steps. The first is a general…
In this paper we address the complexity of solving linear programming problems with a set of differential equations that converge to a fixed point that represents the optimal solution. Assuming a probabilistic model, where the inputs are…
This paper is about the construction of displacement interpolations on a discrete metric graph. Our approach is based on the approximation of any optimal transport problem whose cost function is a distance on a discrete graph by a sequence…
This paper describes a linear-time algorithm that finds the longest stretch in a sequence of real numbers (``scores'') in which the sum exceeds an input parameter. The algorithm also solves the problem of finding the longest interval in…
Numerous approximation algorithms for problems on unit disk graphs have been proposed in the literature, exhibiting a sharp trade-off between running times and approximation ratios. We introduce a variation of the known shifting strategy…
In several multiobjective decision problems Pairwise Comparison Matrices (PCM) are applied to evaluate the decision variants. The problem that arises very often is the inconsistency of a given PCM. In such a situation it is important to…
The problem is considered of arranging symbols around a cycle, in such a way that distances between different instances of a same symbol be as uniformly distributed as possible. A sequence of moments is defined for cycles, similarly to the…
The paper deals with the distributed minimum sharing problem: a set of decision-makers compute the minimum of some local quantities of interest in a distributed and decentralized way by exchanging information through a communication…
In this paper we study the problem of locating a given number of hyperplanes minimizing an objective function of the closest distances from a set of points. We propose a general framework for the problem in which norm-based distances…
This paper proposes distributed algorithms for solving linear equations to seek a least square solution via multi-agent networks. We consider that each agent has only access to a small and imcomplete block of linear equations rather than…
In this work, we carry out structural and algorithmic studies of a problem of barrier forming: selecting theminimum number of straight line segments (barriers) that separate several sets of mutually disjoint objects in the plane. The…
In this paper, the problem of the minimal description of the structure of a vector function f(x) over an $N$-dimensional interval is studied. Methods adaptively subdividing the original interval in smaller subintervals and evaluating f(x)…