Related papers: Representation of conformal maps by rational funct…
We construct rational all-pass matrix functions with real-valued coefficients for mirroring pairs of complex-conjugated determinantal roots of a rational matrix. This problem appears, for example, when proving the spectral factorization…
Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…
While the trapezoidal formula can attain exponential convergence when applied to infinite integrals of bilateral rapidly decreasing functions, it is not capable of this in the case of unilateral rapidly decreasing functions. To address this…
Rational and neural network based approximations are efficient tools in modern approximation. These approaches are able to produce accurate approximations to nonsmooth and non-Lipschitz functions, including multivariate domain functions. In…
In this paper, we consider the problem of covering a plane region with unit discs. We present an improved upper bound and the first nontrivial lower bound on the number of discs needed for such a covering, depending on the area and…
Conformal mapping may be the best-known topic in complex analysis. Any simply connected nonempty domain $\Omega$ in the complex plane ${{\mathbb{C}}}$ (assuming $\Omega\ne {{\mathbb{C}}}$) can be mapped bijectively to the unit disk by an…
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…
The conjugate function method is an algorithm for numerical computation of conformal mappings for simply and doubly connected domains. In this paper the conjugate function method is generalized for multiply connected domains. The key…
Quadratic-support functions [Aravkin, Burke, and Pillonetto; J. Mach. Learn. Res. 14(1), 2013] constitute a parametric family of convex functions that includes a range of useful regularization terms found in applications of convex…
As demonstrated in many areas of real-life applications, neural networks have the capability of dealing with high dimensional data. In the fields of optimal control and dynamical systems, the same capability was studied and verified in many…
We discuss a class of regions and conformal mappings which are useful in several problems of approximation theory, harmonic analysis and spectral theory.
We present an extension of the AAA (adaptive Antoulas--Anderson) algorithm for periodic functions, called 'AAAtrig'. The algorithm uses the key steps of AAA approximation by (i) representing the approximant in (trigonometric) barycentric…
We find a system of two polynomial equations in two unknowns, whose solution allows to give an explicit expression of the conformal representation of a simply connected three sheeted compact Riemann surface onto the extended complex plane.…
Due to the significant progress made in the implementation of quantum hardware, efficient methods and tools to design corresponding algorithms become increasingly important. Many of these tools rely on functional representations of certain…
We use discrete holomorphic polynomials to prove that, given a refining sequence of critical maps of a Riemann surface, any holomorphic function can be approximated by a converging sequence of discrete holomorphic functions.
Successive quadratic approximations, or second-order proximal methods, are useful for minimizing functions that are a sum of a smooth part and a convex, possibly nonsmooth part that promotes regularization. Most analyses of iteration…
Let $U$ be a multiply connected domain of the Riemann sphere $\hat{C}$ whose complement $\hat{C}\setminus U$ has $N<\infty$ components. We show that every conformal map on $U$ can be written as a composition of $N$ maps conformal on simply…
In this paper we describe an algorithm for implicitizing rational hypersurfaces in case there exists at most a finite number of base points. It is based on a technique exposed in math.AG/0210096, where implicit equations are obtained as…
In a rectilinear dual of a planar graph vertices are represented by simple rectilinear polygons and edges are represented by side-contact between the corresponding polygons. A rectilinear dual is called a cartogram if the area of each…
We present a method for computing all the symmetries of a rational ruled surface defined by a rational parametrization which works directly in parametric rational form, i.e. without computing or making use of the implicit equation of the…