arXiv subjects

Olivier Sète

Publications and source records attributed to Olivier Sète.

At least 19 recordsLinked to original sources

arXiv2026

The Complex Green's Function for Symmetric Sets

The aim of this paper is threefold: (i) We study the complex Green's function (the analytic extension of the real Green's function) for multiply connected domains with some symmetry and transform it to a simple form with the help of Walsh's conformal map onto lemniscatic domains. (ii) For the complement of the union of two real intervals, we represent the complex Green's function with the help of Jacobi's elliptic and theta functions. (iii) Using this representation, we explicitly obtain all parameters of the lemniscatic domain corresponding to the complement of the two intervals. In addition, using an equality between the corresponding complex Green's functions, we obtain a numerical method for computing the conformal map from the complement of two intervals onto a lemniscatic domain which yields more accurate results than a previous method from the literature.

math.CV↗

arXiv2024

On the zeros of polyanalytic polynomials

We give sufficient conditions under which a polyanalytic polynomial of degree $n$ has (i) at least one zero, and (ii) finitely many zeros. In the latter case, we prove that the number of zeros is bounded by $n^2$. We then show that for all $k \in \{0,\dots, n^2, \infty\}$ there exists a polyanalytic polynomial of degree $n$ with exactly $k$ distinct zeros. Moreover, we generalize the Lagrange and Cauchy bounds from analytic to polyanalytic polynomials and obtain inclusion disks for the zeros. Finally, we construct a harmonic and thus polyanalytic polynomial of degree $n$ with $n$ nonzero coefficients and the maximum number of $n^2$ zeros.

math.CV↗

arXiv2024

Walsh's Conformal Map onto Lemniscatic Domains for Several Intervals

We consider Walsh's conformal map from the complement of a compact set $E = \cup_{j=1}^\ell E_j$ with $\ell$ components onto a lemniscatic domain $\widehat{\mathbb{C}} \setminus L$, where $L$ has the form $L = \{ w \in \mathbb{C} : \prod_{j=1}^\ell \lvert w - a_j \rvert^{m_j} \leq \operatorname{cap}(E) \}$. We prove that the exponents $m_j$ appearing in $L$ satisfy $m_j = μ_E(E_j)$, where $μ_E$ is the equilibrium measure of $E$. When $E$ is the union of $\ell$ real intervals, we derive a fast algorithm for computing the centers $a_1, \ldots, a_\ell$. For $\ell = 2$, the formulas for $m_1, m_2$ and $a_1, a_2$ are explicit. Moreover, we obtain the conformal map numerically. Our approach relies on the real and complex Green's functions of $\widehat{\mathbb{C}} \setminus E$ and $\widehat{\mathbb{C}} \setminus L$.

math.CV↗

arXiv2023

Stochastic Galerkin method and port-Hamiltonian form for linear first-order ordinary differential equations

We consider linear first-order systems of ordinary differential equations (ODEs) in port-Hamiltonian (pH) form. Physical parameters are remodelled as random variables to conduct an uncertainty quantification. A stochastic Galerkin projection yields a larger deterministic system of ODEs, which does not exhibit a pH form in general. We apply transformations of the original systems such that the stochastic Galerkin projection becomes structure-preserving. Furthermore, we investigate meaning and properties of the Hamiltonian function belonging to the stochastic Galerkin system. A large number of random variables implies a highdimensional stochastic Galerkin system, which suggests itself to apply model order reduction (MOR) generating a low-dimensional system of ODEs. We discuss structure preservation in projection-based MOR, where the smaller systems of ODEs feature pH form again. Results of numerical computations are presented using two test examples.

math.NA↗

arXiv2023

Minimal degree rational open up mappings and related questions

We establish the existence and uniqueness of rational conformal maps of minimal degree $n+1$ for opening up $n$ arcs. In earlier results, the degree was exponential in $n$. We also discuss two related problems. (a) We establish existence of rational functions of minimal degree with prescribed critical values, and show that the number of (suitably normalized) rational functions is given in terms of the Hurwitz numbers. (b) We consider the problem of finding rational functions of minimal degree with prescribed critical points, where we establish existence of solutions by considering certain polynomial equations, and where the number of normalized solutions is bounded from above by a Catalan number. We illustrate our results with two examples.

math.CV↗

arXiv2023

Walsh's Conformal Map onto Lemniscatic Domains for Polynomial Pre-images II

We consider Walsh's conformal map from the exterior of a set $E=\bigcup_{j=1}^\ell E_j$ consisting of $\ell$ compact disjoint components onto a lemniscatic domain. In particular, we are interested in the case when $E$ is a polynomial preimage of $[-1,1]$, i.e., when $E=P^{-1}([-1,1])$, where $P$ is an algebraic polynomial of degree $n$. Of special interest are the exponents and the centers of the lemniscatic domain. In the first part of this series of papers, a very simple formula for the exponents has been derived. In this paper, based on general results of the first part, we give an iterative method for computing the centers when $E$ is the union of $\ell$ intervals. Once the centers are known, the corresponding Walsh map can be computed numerically. In addition, if $E$ consists of $\ell=2$ or $\ell=3$ components satisfying certain symmetry relations then the centers and the corresponding Walsh map are given by explicit formulas. All our theorems are illustrated with analytical or numerical examples.

math.CV↗

arXiv2023

Computing the logarithmic capacity of compact sets having (infinitely) many components with the Charge Simulation Method

We apply the Charge Simulation Method (CSM) in order to compute the logarithmic capacity of compact sets consisting of (infinitely) many "small" components. This application allows to use just a single charge point for each component. The resulting method therefore is significantly more efficient than methods based on discretizations of the boundaries (for example, our own method presented in [Liesen, Sète, Nasser, 2017]), while maintaining a very high level of accuracy. We study properties of the linear algebraic systems that arise in the CSM, and show how these systems can be solved efficiently using preconditioned iterative methods, where the matrix-vector products are computed using the Fast Multipole Method. We illustrate the use of the method on generalized Cantor sets and the Cantor dust.

math.NA↗

arXiv2022

The Helmholtz equation with uncertainties in the wavenumber

We investigate the Helmholtz equation with suitable boundary conditions and uncertainties in the wavenumber. Thus the wavenumber is modeled as a random variable or a random field. We discretize the Helmholtz equation using finite differences in space, which leads to a linear system of algebraic equations including random variables. A stochastic Galerkin method yields a deterministic linear system of algebraic equations. This linear system is high-dimensional, sparse and complex symmetric but, in general, not hermitian. We therefore solve this system iteratively with GMRES and propose two preconditioners: a complex shifted Laplace preconditioner and a mean value preconditioner. Both preconditioners reduce the number of iteration steps as well as the computation time in our numerical experiments.

math.NA↗

arXiv2022

Walsh's conformal map onto lemniscatic domains for polynomial pre-images I

We consider Walsh's conformal map from the exterior of a compact set $E \subseteq \mathbb{C}$ onto a lemniscatic domain. If $E$ is simply connected, the lemniscatic domain is the exterior of a circle, while if $E$ has several components, the lemniscatic domain is the exterior of a generalized lemniscate and is determined by the logarithmic capacity of $E$ and by the exponents and centers of the generalized lemniscate. For general $E$, we characterize the exponents in terms of the Green's function of $E^c$. Under additional symmetry conditions on $E$, we also locate the centers of the lemniscatic domain. For polynomial pre-images $E = P^{-1}(Ω)$ of a simply-connected infinite compact set $Ω$, we explicitly determine the exponents in the lemniscatic domain and derive a set of equations to determine the centers of the lemniscatic domain. Finally, we present several examples where we explicitly obtain the exponents and centers of the lemniscatic domain, as well as the conformal map.

math.CV↗

arXiv2021

The transport of images method: computing all zeros of harmonic mappings by continuation

We present a continuation method to compute all zeros of a harmonic mapping $f$ in the complex plane. Our method works without any prior knowledge of the number of zeros or their approximate location. We start by computing all solution of $f(z) = η$ with $|η|$ sufficiently large and then track all solutions as $η$ tends to $0$ to finally obtain all zeros of $f$. Using theoretical results on harmonic mappings we analyze where and how the number of solutions of $f(z) = η$ changes and incorporate this into the method. We prove that our method is guaranteed to compute all zeros, as long as none of them is singular. In our numerical example the method always terminates with the correct number of zeros, is very fast compared to general purpose root finders and is highly accurate in terms of the residual. An easy-to-use MATLAB implementation is freely available online.

math.NA↗

arXiv2020

Number and location of pre-images under harmonic mappings in the plane

We derive a formula for the number of pre-images under a non-degenerate harmonic mapping $f$, using the argument principle. This formula reveals a connection between the pre-images and the caustics. Our results allow to deduce the number of pre-images under $f$ geometrically for every non-caustic point. We approximately locate the pre-images of points near the caustics. Moreover, we apply our results to prove that for every $k = n, n+1, \ldots, n^2$ there exists a harmonic polynomial of degree $n$ with $k$ zeros.

math.CV↗

arXiv2019

A Newton method for harmonic mappings in the plane

We present an iterative root finding method for harmonic mappings in the complex plane, which is a generalization of Newton's method for analytic functions. The complex formulation of the method allows an analysis in a complex variables spirit. For zeros close to poles of $f = h + \bar{g}$ we construct initial points for which the harmonic Newton iteration is guaranteed to converge. Moreover, we study the number of solutions of $f(z) = η$ close to the critical set of $f$ for certain $η\in \mathbb{C}$. We provide a Matlab implementation of the method, and illustrate our results with several examples and numerical experiments, including phase plots and plots of the basins of attraction.

math.CV↗

arXiv2017

The index of singular zeros of harmonic mappings of anti-analytic degree one

We study harmonic mappings of the form $f(z) = h(z) - \overline{z}$, where $h$ is an analytic function. In particular we are interested in the index (a generalized multiplicity) of the zeros of such functions. Outside the critical set of $f$, where the Jacobian of $f$ is non-vanishing, it is known that this index has similar properties as the classical multiplicity of zeros of analytic functions. Little is known about the index of zeros on the critical set, where the Jacobian vanishes; such zeros are called singular zeros. Our main result is a characterization of the index of singular zeros, which enables one to determine the index directly from the power series of $h$.

math.CV↗

arXiv2017

The AAA algorithm for rational approximation

We introduce a new algorithm for approximation by rational functions on a real or complex set of points, implementable in 40 lines of Matlab and requiring no user input parameters. Even on a disk or interval the algorithm may outperform existing methods, and on more complicated domains it is especially competitive. The core ideas are (1) representation of the rational approximant in barycentric form with interpolation at certain support points and (2) greedy selection of the support points to avoid exponential instabilities. The name AAA stands for "adaptive Antoulas--Anderson" in honor of the authors who introduced a scheme based on (1). We present the core algorithm with a Matlab code and nine applications and describe variants targeted at problems of different kinds. Comparisons are made with vector fitting, RKFIT, and other existing methods for rational approximation.

math.NA↗

arXiv2016

Fast and accurate computation of the logarithmic capacity of compact sets

We present a numerical method for computing the logarithmic capacity of compact subsets of $\mathbb{C}$, which are bounded by Jordan curves and have finitely connected complement. The subsets may have several components and need not have any special symmetry. The method relies on the conformal map onto lemniscatic domains and, computationally, on the solution of a boundary integral equation with the Neumann kernel. Our numerical examples indicate that the method is fast and accurate. We apply it to give an estimate of the logarithmic capacity of the Cantor middle third set and generalizations of it.

math.NA↗

arXiv2016

Properties and examples of Faber--Walsh polynomials

The Faber--Walsh polynomials are a direct generalization of the (classical) Faber polynomials from simply connected sets to sets with several simply connected components. In this paper we derive new properties of the Faber--Walsh polynomials, where we focus on results of interest in numerical linear algebra, and on the relation between the Faber--Walsh polynomials and the classical Faber and Chebyshev polynomials. Moreover, we present examples of Faber--Walsh polynomials for two real intervals as well as some non-real sets consisting of several simply connected components.

math.CV↗

arXiv2016

On conformal maps from multiply connected domains onto lemniscatic domains

We study conformal maps from multiply connected domains in the extended complex plane onto lemniscatic domains. Walsh proved the existence of such maps in 1956 and thus obtained a direct generalization of the Riemann mapping theorem to multiply connected domains. For polynomial pre-images of simply connected sets we derive a construction principle for Walsh's conformal map in terms of the Riemann map for the simply connected set. Moreover, we explicitly construct examples of Walsh's conformal map for certain radial slit domains and circular domains.

math.CV↗

arXiv2015

Numerical computation of the conformal map onto lemniscatic domains

We present a numerical method for the computation of the conformal map from unbounded multiply-connected domains onto lemniscatic domains. For $\ell$-times connected domains the method requires solving $\ell$ boundary integral equations with the Neumann kernel. This can be done in $O(\ell^2 n \log n)$ operations, where $n$ is the number of nodes in the discretization of each boundary component of the multiply connected domain. As demonstrated by numerical examples, the method works for domains with close-to-touching boundaries, non-convex boundaries, piecewise smooth boundaries, and for domains of high connectivity.

math.CV↗