SearcharxivSearch

arXiv subjects

Matti Vuorinen

Publications and source records attributed to Matti Vuorinen.

At least 19 recordsLinked to original sources

Möbius Maps, Reflections and Lipschitz Constants

We introduce the chordal isometric circle of a Möbius map, and use this to give a factorization of any Möbius map as the composition of a chordal isometry and either a reflection, or a rotary reflection, across a circle. We then use this to find the chordal, and spherical, Lipschitz constants of a Möbius map, and compare this with related results in the literature.

math.CV

Hilbert metric and Hölder continuity of quasiregular mappings

We prove several formulas for the Hilbert metric in the unit disk and apply these results to study quasiregular mappings of the unit disk $\mathbb{B}^2$ onto a bounded convex domain $D$. The main result deals with the Hölder continuity of these mappings with respect to Hilbert metrics of $\mathbb{B}^2$ and $D$. Also several open problems are formulated.

math.CV

Shortest paths in planar domains with hyperbolic type metrics

We study planar domains $G$ equipped with a hyperbolic type metric and approximate geodesics that join two points $x,y \in G$ and their lengths. We present an algorithm that enables one to approximate the shortest distance in polygonal domains taken with respect to the quasihyperbolic metric. The method is based on Dijkstra's algorithm, and we give several examples demonstrating how the algorithm works and analyze its accuracy. We experimentally demonstrate several previously theoretically observed features of geodesics, such as the relationship between hyperbolic and quasihyperbolic distance in the unit disk. We also investigate bifurcation of geodesics and the connection of this phenomenon to the medial axis of the domain.

math.MG

A boundary integral equation method for Steklov eigenvalue problems for smooth planar domains

In this paper, we study the computational question of whether the Steklov spectrum of smooth simply connected planar domains can be approximated accurately by a boundary-only formulation based on harmonic conjugation. For the unit disk, the Dirichlet-to-Neumann operator can be written explicitly in terms of the classical conjugation operator. We show how this viewpoint extends to general bounded and unbounded simply connected domains through the generalized conjugation operator defined through the boundary integral equation with the generalized Neumann kernel. Combined with Fourier differentiation on an equidistant boundary grid, this leads to a dense algebraic eigenvalue problem for the boundary traces of Steklov eigenfunctions. The resulting method uses only boundary data, treats interior and exterior problems in a unified way, and reconstructs eigenfunctions in the domain by harmonic extension. Numerical experiments on benchmark domains and on parameter-dependent smooth families, including ellipses and star-like curves, show high accuracy for smooth boundaries and illustrate how the Steklov spectrum changes with geometry.

math.NA

Fast capacity computation for maze-like configurations

We study the conformal capacity ${\rm cap}(Ω,K)$ where $Ω$ is a bounded domain of $\mathbb{R}^2$ and $K$ is a compact connected set in $Ω$. Because the exact numerical value of the capacity is known only in a handful of special cases, it is important to find estimates for the capacity in terms of domain functionals, simpler than the capacity itself. Here, we study condensers of maze-like structure and compute their capacity by means of a high-order $hp$- finite element method. We compare these numerical results to the estimates given by the quasihyperbolic length and perimeter of the compact set. In particular, we consider the behaviour of these value pairs, numerical results and estimates, when the structure parameters vary and the walls of the maze approach the compact set. Over the configurations covered in the numerical experiments, the quasihyperbolic estimates are shown to have the desired asymptotic properties and superior computational efficiencies once the case-specific analysis is completed.

math.NA

On computation of capacities and conformal invariants

We give a survey of computation of the conformal capacity of planar condensers, generalized capacity, and logarithmic capacity with emphasis on our recent work 2020-2025. We also discuss some applications of our method based on the boundary integral equation with the generalized Neumann kernel to the computation of several other conformal invariants: harmonic measure, modulus of a quadrilateral, reduced modulus, hyperbolic capacity, and elliptic capacity. Here the solution of mixed Dirichlet-Neumann boundary value problem for the Laplace equation has a key role. At the end of the paper we give a topicwise structured list to our extensive bibliography on constructive complex analysis and potential theory.

math.CV

On the average scale-invariant Cassinian metric

We establish geometric relationships between the average scale-invariant Cassinian metric and other hyperbolic type metrics. In addition, we study the local convexity properties of the scale-invariant metric balls in Euclidean once punctured spaces.

math.MG

Constrained maximization of conformal capacity

We consider constellations of disks which are unions of disjoint hyperbolic disks in the unit disk with fixed radii and unfixed centers. We study the problem of maximizing the conformal capacity of a constellation with a fixed number of disks under constraints on the centers in two cases. In the first case the constraint is that the centers are at most at distance $R \in(0,1)$ from the origin and in the second case it is required that the centers are on the subsegment $[-R,R]$ of a diameter of the unit disk. We study also similar types of constellations with hyperbolic segments instead of the hyperbolic disks. Our computational experiments suggest that a dispersion phenomenon occurs: the disks/segments go as close to the unit circle as possible under these constraints and stay as far as possible from each other. The computation of capacity reduces to the Dirichlet problem for the Laplace equation which we solve using two methods: a fast boundary integral equation method and a high-order finite element method.

math.CV

Hilbert metric and quasiconformal mappings

We prove a functional identity between the Hilbert metric and the visual angle metric in the unit disk. The proof utilizes the Poincaré hyperbolic metric in terms of which both metrics can be expressed. This identity then yields sharp distortion results for quasiregular mappings and analytic functions, expressed in terms of the Hilbert metric. We also prove that Hilbert circles are, in fact, Euclidean ellipses. The proof makes use of computer algebra methods. In particular, Gröbner bases are used.

math.CV

Visual angle metric in the upper half plane

We prove an identity which connects the visual angle metric $v_{\mathbb{H}^2}$ and the hyperbolic metric $ρ_{\mathbb{H}^2}$ of the upper half plane $\mathbb{H}^2$. The proof is based on geometric arguments and uses computer algebra methods for formula manipulation. We also prove a sharp Hölder continuity result for quasiregular mappings with respect to the visual angle metric.

math.MG

Modulus estimates of semirings with applications to boundary extension problems

In our previous paper [GSV2020], we proved that the complementary components of a ring domain in $\mathbb{R}^n$ with large enough modulus may be separated by an annular ring domain and applied this result to boundary correspondence problems under quasiconformal mappings. In the present paper, we continue this work and investigate boundary extension problems for a larger class of mappings.

math.CV

Collinearity of points on Poincaré unit disk and Riemann sphere

We study certain points significant for the hyperbolic geometry of the unit disk. We give explicit formulas for the intersection points of the Euclidean lines and the stereographic projections of great circles of the Riemann sphere passing through these points. We prove several results related to collinearity of these intersection points, offer new ways to find the hyperbolic midpoint, and represent a formula for the chordal midpoint. The proofs utilize Gröbner bases from computer algebra for the solution of polynomial equations.

math.MG

Fast computation of analytic capacity

A boundary integral equation method is presented for fast computation of the analytic capacities of compact sets in the complex plane. The method is based on using the Kerzman--Stein integral equation to compute the Szegö kernel and then the value of the Ahlfors map at the point at infinity. The proposed method can be used for domains with smooth and piecewise smooth boundaries. When combined with conformal mappings, the method can be used for compact slit sets. Several numerical examples are presented to demonstrate the efficiency of the proposed method. We recover some known exact results and corroborate the conjectural subadditivity property of analytic capacity.

math.CV

Formulas for the visual angle metric

We prove several new formulas for the visual angle metric of the unit disk in terms of the hyperbolic metric and apply these to prove a sharp Schwarz lemma for the visual angle metric under quasiregular mappings.

math.CV

On angular limits of quasiregular mappings

We investigate Lindelöf and Koebe type boundary behavior results for bounded quasiregular mappings in $n$-dimensional Euclidean space. Our results give sufficient conditions for the existence of non-tangential limits at a boundary point.

math.CV

Landen transformations applied to approximation

We study computational methods for the approximation of special functions recurrent in geometric function theory and quasiconformal mapping theory. The functions studied can be expressed as quotients of complete elliptic integrals and as inverses of such quotients. In particular, we consider the distortion function $φ_K(r)$ which gives a majorant for $|f(x)|$ when $f: \mathbb{B}^2 \to \mathbb{B}^2, f(0)=0,$ is a quasiconformal mapping of the unit disk $\mathbb{B}^2.$ It turns out that the approximation method is very simple: five steps of Landen iteration is enough to achieve machine precision.

math.CV