Related papers: Numerical conformal mapping with rational function…
As an alternative to PINNs, a Deep Ritz framework is proposed to solve fully nonlinear PDEs. A least-squares algorithm is advocated to decouple the nonlinearities from the variational features of several fully nonlinear PDEs. A splitting…
Inspired by regularization techniques in statistics and machine learning, we study complementary composite minimization in the stochastic setting. This problem corresponds to the minimization of the sum of a (weakly) smooth function endowed…
We use conformal maps to study a free boundary problem for a two-fluid electromechanical system, where the interface between the fluids is determined by the combined effects of electrostatic forces, gravity and surface tension. The free…
For approximately solving linear ill-posed problems in Hilbert spaces, we investigate the regularization properties of the aggregation method and the RatCG method. These recent algorithms use previously calculated solutions of Tikhonov…
We study approximations to the Moreau envelope -- and infimal convolutions more broadly -- based on Laplace's method, a classical tool in analysis which ties certain integrals to suprema of their integrands. We believe the connection…
In this note we prove a new symmetrization result, in the form of mass concentration comparison, for solutions of nonlocal nonlinear Dirichlet problems involving fractional p Laplacians. Some regularity estimates of solutions will be…
Rounding linear programs using techniques from discrepancy is a recent approach that has been very successful in certain settings. However this method also has some limitations when compared to approaches such as randomized and iterative…
The numerical methods for differential equation solution allow obtaining a discrete field that converges towards the solution if the method is applied to the correct problem. Nevertheless, the numerical methods have the restricted class of…
We numerically benchmark methods for computing harmonic maps into the unit sphere, with particular focus on harmonic maps with singularities. For the discretization we compare two different approaches, both based on Lagrange finite…
We extend recent work of Gurel-Gurevich--Jerison--Nachmias (2020) and Bou-Rabee--Gwynne (2024) by showing that as the mesh of our lattice tends to $0$, we have a polynomial rate of convergence for the Dirichlet problem on orthodiagonal maps…
Boundary integral equations and Nystrom discretization provide a powerful tool for the solution of Laplace and Helmholtz boundary value problems. However, often a weakly-singular kernel arises, in which case specialized quadratures that…
The paper proves a result on the convergence of discrete conformal maps to the Riemann mappings for Jordan domains. It is a counterpart of Rodin-Sullivan's theorem on convergence of circle packing mappings to the Riemann mapping in the new…
We study numerical conformal mappings of planar Jordan domains with boundaries consisting of finitely many circular arcs and compute the moduli of quadrilaterals for these domains. Experimental error estimates are provided and, when…
We demonstrate that solving the classical problems mentioned in the title on quadrature domains when the given boundary data is rational is as simple as the method of partial fractions. A by-product of our considerations will be a simple…
We study several variations of line segment covering problem with axis-parallel unit squares in $I\!\!R^2$. A set $S$ of $n$ line segments is given. The objective is to find the minimum number of axis-parallel unit squares which cover at…
In this paper, we first derive a theoretical basis for spherical conformal parameterizations between a simply connected closed surface $\mathcal{S}$ and a unit sphere $\mathbb{S}^2$ by minimizing the Dirichlet energy on…
Aligning partially overlapping point sets where there is no prior information about the value of the transformation is a challenging problem in computer vision. To achieve this goal, we first reduce the objective of the robust point…
We consider minimization of functions that are compositions of convex or prox-regular functions (possibly extended-valued) with smooth vector functions. A wide variety of important optimization problems fall into this framework. We describe…
In many astronomical problems one often needs to determine the upper and/or lower boundary of a given data set. An automatic and objective approach consists in fitting the data using a generalised least-squares method, where the function to…
The focus of this article is the approximation of functions which are analytic on a compact interval except at the endpoints. Typical numerical methods for approximating such functions depend upon the use of particular conformal maps from…