Related papers: Convergence of an iterative algorithm for Teichm\"…
Topological mating is an combination that takes two same-degree polynomials and produces a new map with dynamics inherited from this initial pair. This process frequently yields a map that is Thurston-equivalent to a rational map $F$ on the…
We prove that for any open Riemann surface $M$ and any non constant harmonic function $h:M \to \mathbb{R},$ there exists a complete conformal minimal immersion $X:M \to \mathbb{R}^3$ whose third coordinate function coincides with $h.$ As a…
The goal of tensor completion is to fill in missing entries of a partially known tensor (possibly including some noise) under a low-rank constraint. This may be formulated as a least-squares problem. The set of tensors of a given…
We leverage the connections between nonexpansive maps, monotone Lipschitz operators, and proximal mappings to obtain near-optimal (i.e., optimal up to poly-log factors in terms of iteration complexity) and parameter-free methods for solving…
We present a cost-efficient and versatile method to map an unknown 3D freeform surface using only sparse measurements while the end-effector of a robotic manipulator moves along the surface. The geometry is locally approximated by a plane,…
Orthogonality constraints naturally appear in many machine learning problems, from principal component analysis to robust neural network training. They are usually solved using Riemannian optimization algorithms, which minimize the…
Stratified digraphs are popular models for feedforward neural networks. However, computation of their path homologies has been limited to low dimensions due to high computational complexity. A recursive algorithm is proposed to compute…
In this paper, we prove a uniform approximation theorem with interpolation for complete conformal minimal surfaces with finite total curvature in the Euclidean space $\mathbb{R}^n$ $(n\ge 3)$. As application, we obtain a Mittag-Leffler type…
We study compact hyperbolic surface laminations. These are a generalization of closed hyperbolic surfaces which appear to be more suited to the study of Teichm\"uller theory than arbitrary non-compact surfaces. We show that the…
Given an unlabeled road map, we consider, from an algorithmic perspective, the cartographic problem to place non-overlapping road labels embedded in their roads. We first decompose the road network into logically coherent road sections,…
Extremal length is an important conformal invariant on Riemann surface. It is closely related to the geometry of Teichmuller metric on Teichmuller space. By identifying extremal length functions with energy of harmonic maps from Riemann…
The traditional view in numerical conformal mapping is that once the boundary correspondence function has been found, the map and its inverse can be evaluated by contour integrals. We propose that it is much simpler, and 10-1000 times…
Let $(\Sigma,p)$ be a pointed Riemann surface of genus $g\geq 1$. For any integer $k\geq 1$, we parametrize the space of meromorphic quadratic differentials on $\Sigma$ with a pole of order $(k+2)$ at $p$, having a connected critical graph…
A triangulation of a surface is irreducible if there is no edge whose contraction produces another triangulation of the surface. In this work we propose an algorithm that constructs the set of irreducible triangulations of any surface with…
In this paper, a new iterative two-level algorithm is presented for solving the finite element discretization for nonsymmetric or indefinite elliptic problems. The iterative two-level algorithm uses the same coarse space as the traditional…
Writing an uncomplicated, robust, and scalable three-dimensional convex hull algorithm is challenging and problematic. This includes, coplanar and collinear issues, numerical accuracy, performance, and complexity trade-offs. While there are…
The Riemann problem for first-order hyperbolic systems of partial differential equations is of fundamental importance for both theoretical and numerical purposes. Many approximate solvers have been developed for such systems; exact solution…
This article studies the smoothness of conformal mappings between two Riemannian manifolds whose metric tensors have limited regularity. We show that any bi-Lipschitz conformal mapping or $1$-quasiregular mapping between two manifolds with…
The proximal point algorithm is a widely used tool for solving a variety of convex optimization problems such as finding zeros of maximally monotone operators, fixed points of nonexpansive mappings, as well as minimizing convex functions.…
Since the popularization of the Stiefel manifold for numerical applications in 1998 in a seminal paper from Edelman et al., it has been exhibited to be a key to solve many problems from optimization, statistics and machine learning. In…