Related papers: Set-oriented numerical computation of rotation set…
This article develops a new predictor-corrector algorithm for numerical path tracking in the context of polynomial homotopy continuation. In the corrector step it uses a newly developed Newton corrector algorithm which rejects an initial…
Consider the geometric inverse problem: There is a set of delta-sources in spacetime that emit waves travelling at unit speed. If we know all the arrival times at the boundary cylinder of the spacetime, can we reconstruct the space, a…
Floating-point arithmetic performance determines the overall performance of important applications, from graphics to AI. Meeting the IEEE-754 specification for floating-point requires that final results of addition, subtraction,…
This paper develops matrix-multiplication-based iterative refinement for diagonalizable non-Hermitian eigendecompositions. The main theory concerns simple eigenvalues and distinguishes two input regimes. In the right-only regime, where only…
Let $f$ be a homeomorphism of the closed annulus $A$ isotopic to the identity, and let $X\subset {\rm Int}A$ be an $f$-invariant continuum which separates $A$ into two domains, the upper domain $U_+$ and the lower domain $U_-$. Fixing a…
We describe and analyze an algorithm for computing the homology (Betti numbers and torsion coefficients) of basic semialgebraic sets which works in weak exponential time. That is, out of a set of exponentially small measure in the space of…
The rotation of multi-dimensional arrays, or tensors, is a fundamental operation in computer science with applications ranging from data processing to scientific computing. While various methods exist, achieving this rotation in-place…
The inverse problem of diffraction theory in essence amounts to the reconstruction of the atomic positions of a solid from its diffraction image. From a mathematical perspective, this is a notoriously difficult problem, even in the…
Choosing a basis set is the first step of a quantum chemistry calculation and it sets its maximum accuracy. This choice of orbitals is limited by strong technical constraints as one must be able to compute a large number of six dimensional…
By a map we mean a $2$-cell decomposition of a closed compact surface, i.e., an embedding of a graph such that every face is homeomorphic to an open disc. Automorphism of a map can be thought of as a permutation of the vertices which…
Let $X$ be a compact Hausdorff space, with uniformity $\mathscr{U}$, and let $f \colon X \to X$ be a continuous function. For $D \in \mathscr{U}$, a $D$-pseudo-orbit is a sequence $(x_i)$ for which $(f(x_i),x_{i+1}) \in D$ for all indices…
Conventional ways to solve optimization problems on low-rank matrix sets which appear in great number of applications ignore its underlying structure of an algebraic variety and existence of singular points. This leads to appearance of…
The orientation of a rigid object can be described by a rotation that transforms it into a standard position. For a symmetrical object the rotation is known only up to multiplication by an element of the symmetry group. Such ambiguous…
In this article, we develop a trust-region technique to find critical points of unconstrained set optimization problems with the objective set-valued map defined by finitely many twice continuously differentiable functions. The technique is…
Computationally solving multi-marginal optimal transport (MOT) with squared Euclidean costs for $N$ discrete probability measures has recently attracted considerable attention, in part because of the correspondence of its solutions with…
We are concerned with structured $\ell_0$-norms regularization problems, with a twice continuously differentiable loss function and a box constraint. This class of problems have a wide range of applications in statistics, machine learning…
We investigate convergence of the expectation maximization algorithm by representing it as a generalized proximal method. Convergence of iterates and not just in value is investigated under natural hypotheses such as definability of the…
We develop a matricial version of Rieffel's Gromov-Hausdorff distance for compact quantum metric spaces within the setting of operator systems and unital C*-algebras. Our approach yields a metric space of ``isometric'' unital complete order…
This letter presents an almost sure convergence of the zeroth-order mirror descent algorithm. The algorithm admits non-smooth convex functions and a biased oracle which only provides noisy function value at any desired point. We approximate…
A rotational set is a finite subset $A$ of the unit circle $\mathbb{T}=\mathbb{R}/ \mathbb{Z}$ such that the angle-multiplying map $\sigma_{d}:t\mapsto dt$ maps $A$ onto itself by a cyclic permutation of its elements. Each rotational set…