Computability in Harmonic Analysis

DOI10.1007/S10208-021-09524-WMaRDI QIDQ6354141arXivFDO

Authors Ilia Binder, Adi Glücksam, Cristobal Rojas, Michael Yampolsky

Publication date 19 November 2020

Published in arXiv

Full work available at URL https://doi.org/10.1007/S10208-021-09524-W

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78) Capacity and harmonic measure in the complex plane (30C85)

arXiv classification

math.CAmath.CVmath.LO

Abstract: We study the question of constructive approximation of the harmonic measure $omeg{a}_x^{O}mega$ of a connected bounded domain $Omega$ with respect to a point $xinOmega$. In particular, using a new notion of computable harmonic approximation, we show that for an arbitrary such $Omega$, computability of the harmonic measure $omeg{a}^{O}meg{a}_x$ for a single point $xinOmega$ implies computability of $omeg{a}_y^{O}mega$ for any $yinOmega$. This may require a different algorithm for different points $y$, which leads us to the construction of surprising natural examples of continuous functions that arise as solutions to a Dirichlet problem, whose values can be computed at any point but cannot be computed with the use of the same algorithm on all of their domain. We further study the conditions under which the harmonic measure is computable uniformly, that is by a single algorithm, and characterize them for regular domains with computable boundaries.

This page was built for publication: Computability in Harmonic Analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6354141)