Related papers: Set-oriented numerical computation of rotation set…
We rigorously investigate the convergence of a new numerical method, recently proposed by the authors, to approximate the reproduction numbers of a large class of age-structured population models with finite age span. The method consists in…
The input to the \emph{sets-$k$-means} problem is an integer $k\geq 1$ and a set $\mathcal{P}=\{P_1,\cdots,P_n\}$ of sets in $\mathbb{R}^d$. The goal is to compute a set $C$ of $k$ centers (points) in $\mathbb{R}^d$ that minimizes the sum…
We study the statistical estimation problem of orthogonal group synchronization and rotation group synchronization. The model is $Y_{ij} = Z_i^* Z_j^{*T} + \sigma W_{ij}\in\mathbb{R}^{d\times d}$ where $W_{ij}$ is a Gaussian random matrix…
The numerical approximation of convection-dominated problems continues to remain subject of strong interest. Families of stabilization techniques for finite element methods were developed in the past. Adaptive techniques based on a…
This paper studies homeomorphisms of the closed annulus that are isotopic to the identity from the viewpoint of rotation theory, using a newly developed forcing theory for surface homeomorphisms. Our first result is a solution to the so…
Quasiconformal maps in the plane are orientation preserving homeomorphisms that satisfy certain distortion inequalities; infinitesimally, they map circles to ellipses of bounded eccentricity. Such maps have many useful geometric distortion…
The pseudoinverse of a matrix, a generalized notion of the inverse, is of fundamental importance in linear algebra and, thereby, in many different fields. Despite its proven existence, an algorithmic approach is typically necessary to…
We present a computational methodology for obtaining rotationally symmetric sets of points satisfying discrete geometric constraints, and demonstrate its applicability by discovering new solutions to some well-known problems in…
In this paper, we propose a novel approach for computing robust backward reachable sets from noisy data for unknown constrained linear systems subject to bounded disturbances. In particular, we develop an algorithm for obtaining zonotopic…
The goal of inversion is to estimate the model which generates the data of observations with a specific modeling equation. One general approach to inversion is to use optimization methods which are algebraic in nature to define an objective…
We obtain sharp rotation bounds for the subclass of homeomorphisms $f:\mathbb{C}\to\mathbb{C}$ of finite distortion which have distortion function in $L^p_{loc}$, $p>1$, and for which a H\"older continuous inverse is available. The interest…
One approach to achieving correct finite element assembly is to ensure that the local orientation of facets relative to each cell in the mesh is consistent with the global orientation of that facet. Rognes et al. have shown how to achieve…
We show how to compute efficiently with nominal sets over the total order symmetry, by developing a direct representation of such nominal sets and basic constructions thereon. In contrast to previous approaches, we work directly at the…
Let $Homeo\_0 (R 2 ; 0)$ be the set of all homeomorphisms of the plane isotopic to the identity and which fix 0. Recently in the article entitled "L'ensemble de rotation local autour d'un point fixe" Fr{\'e}d{\'e}ric Le Roux gave the…
The fundamental result of Li, Long, and Srinivasan on approximations of set systems has become a key tool across several communities such as learning theory, algorithms, computational geometry, combinatorics and data analysis. The goal of…
Automated symmetry detection is still a difficult task in 2021. However, it has applications in computer vision, and it also plays an important part in understanding art. This paper focuses on aiding the latter by comparing different…
Zonotopes are widely used for over-approximating forward reachable sets of uncertain linear systems for verification purposes. In this paper, we use zonotopes to achieve more scalable algorithms that under-approximate backward reachable…
We define an on-line (incremental) algorithm that, given a (possibly infinite) pseudo-transitive oriented graph, produces a transitive reorientation. This implies that a theorem of Ghouila-Houri is provable in RCA_0 and hence is computably…
In a previous paper, an implementable algorithm was introduced to compute discrete solutions of sweeping processes (i.e. specific first order differential inclusions). The convergence of this numerical scheme was proved thanks to…
In this paper we consider torus homeomorphisms $f$ homotopic to Dehn twists. We prove that if the vertical rotation set of $f$ is reduced to zero, then there exists a compact connected essential "horizontal" set K, invariant under $f$. In…