相关论文: Convergence of the Zipper algorithm for conformal …

We prove statistical rates of convergence for kernel-based least squares regression from i.i.d. data using a conjugate gradient algorithm, where regularization against overfitting is obtained by early stopping. This method is related to…

A numerical algorithm (implemented in Matlab) for computing the zeros of the parabolic cylinder function $U(a,z)$ in domains of the complex plane is presented. The algorithm uses accurate approximations to the first zero plus a highly…

Discrete conjugate systems are quadrilateral nets with all planar faces. Discrete orthogonal systems are defined by the additional property of all faces being concircular. Their geometric properties allow one to consider them as proper…

The conjugate function method is an algorithm for numerical computation of conformal mappings for simply and multiply connected domains. In this paper, the conjugate function method is extended to cover conformal mappings between Riemannian…

The method of boundary curve reparametrization is applied to construction of the approximate analytical conformal mapping of the unit disk onto an arbitrary given finite domain with a boundary smooth at every point but fininte number of…

This paper deals with a method for the approximation of a spectral density function among the solutions of a generalized moment problem a` la Byrnes/Georgiou/Lindquist. The approximation is pursued with respect to the Kullback-Leibler…

In a seminal paper on finding large matchings in sparse random graphs, Karp and Sipser proposed two algorithms for this task. The second algorithm has been intensely studied, but due to technical difficulties, the first algorithm has…

A conformal flattening maps a curved surface to the plane without distorting angles---such maps have become a fundamental building block for problems in geometry processing, numerical simulation, and computational design. Yet existing…

In this paper, we provide a detailed analysis of the global convergence properties of an extensively studied and extremely effective fixed-point algorithm for the Kullback-Leibler approximation of spectral densities, proposed by Pavon and…

The algorithm for finding the optimal consistent approximation of an inconsistent pairwise comparisons matrix is based on a logarithmic transformation of a pairwise comparisons matrix into a vector space with the Euclidean metric.…

The conformal mapping of the Borel plane can be utilized for the analytic continuation of the Borel transform to the entire positive real semi-axis and is thus helpful in the resummation of divergent perturbation series in quantum field…

In this paper we apply Conformal Prediction (CP) to the k-Nearest Neighbours Regression (k-NNR) algorithm and propose ways of extending the typical nonconformity measure used for regression so far. Unlike traditional regression methods…

Let $\mathbb D$ be the unit disc in $\mathbb C$ and let $f:\mathbb D \to \mathbb C$ be a Riemann map, $\Delta=f(\mathbb D)$. We give a necessary and sufficient condition in terms of hyperbolic distance and horocycles which assures that a…

In this paper, we introduce a definition of discrete conformality for triangulated surfaces with flat cone metrics and describe an algorithm for solving the problem of prescribing curvature, that is to deform the metric discrete conformally…

This paper deals with a modifed iterative projection method for approximating a solution of hierarchical fixed point problems for nearly nonexpansive mappings. Some strong convergence theorems for the proposed method are presented under…

Data-sensitive metrics adapt distances locally based the density of data points with the goal of aligning distances and some notion of similarity. In this paper, we give the first exact algorithm for computing a data-sensitive metric called…

We develop a mixed-integer nonlinear programming (MINLP) approach for the classical Heilbronn triangle problem, demonstrating the capability of modern global optimization solvers to tackle challenging combinatorial geometry problems. A…

We obtain an explicit uniform upper bound for the derivative of a conformal mapping of the unit disk onto a convex domain. This estimate depends only on the outer and inner radii of the domain, and on a curvature radius of its boundary. Its…

Biharmonic and conformal-biharmonic maps are two fourth-order generalizations of the well-studied notion of harmonic maps in Riemannian geometry. In this article we consider maps into the Euclidean sphere and investigate a geometric…

In this survey we present the history and recent progress on several fundamental (quasi)conformal uniformization problems in the complex plane. Uniformization refers to the process of mapping a space to a canonical model by means of a…