On the computational complexity of the Riemann mapping

@article{Binder2005OnTC,
  title={On the computational complexity of the Riemann mapping},
  author={Ilia Binder and Mark Braverman and Michael Yampolsky},
  journal={Arkiv f{\"o}r Matematik},
  year={2005},
  volume={45},
  pages={221-239},
  url={https://api.semanticscholar.org/CorpusID:14545404}
}
This paper gives nontrivial upper and lower bounds in two settings: when the approximation of the boundary is given either as a list of pixels, or by a Turing machine.
[PDF] Semantic Reader
33 Citations
Background Citations
9
Methods Citations
6
Results Citations
1

33 Citations

A Local to Global Principle for the Complexity of Riemann Mappings (Extended Abstract)

We show that the computational complexity of Riemann mappings can be bounded by the complexity needed to compute conformal mappings locally at boundary points. As a consequence we get first formally…

Compactness and the Effectivity of Uniformization

We give new proofs of effective versions of the Riemann mapping theorem, its extension to multiply connected domains and the uniformization on Riemann surfaces. Astonishingly, in the presented proofs…

AN ALGORITHM FOR COMPUTING BOUNDARY EXTENSIONS OF CONFORMAL MAPS

It is shown that from a sufficiently good approximation to a con- formal map of the unit disk onto a bounded domain D, and sufficient local connectivity infor- mation for @D, it is possible to compute arbitrarily good approximations to the boundary extension of �.

Computable Riemann Surfaces

This paper introduces computable and time bounded Riemann surfaces, based on the classical abstract definition by charts, and discusses computable versions of several classical results, such as the existence of complete continuations of holomorphic functions, universal coverings and the uniformization theorem.

Effective Riemann mappings of multiply connected domains and Riemann surfaces

We give new proofs of effective versions of the Riemann mapping theorem, its extension to multiply connected domains and the uniformization on Riemann surfaces. Astonishingly, in the presented…

Computing boundary extensions of conformal maps part 2

It is shown that there is a computable conformal map of the unit disk onto a domain $D$ that has a computable extension to the closure of the unit disk even though the boundary of $D$ is not…

Computable Geometric Complex Analysis and Complex Dynamics

The state of the art regarding computability and complexity of Julia sets, their invariant measures and external rays impressions, and their boundary extensions are reviewed.

Computable Caratheodory Theory

Conformal maps and jagged boundaries

It is shown that there is a computable conformal map of the unit disk onto a domain $D$ that has a computable extension to the closure of the unit disk even though the boundary of $D$ is not…

Computational Complexity in Analysis – Extended

In this paper, well motivated definitions of computational complexity on type-2 objects are introduced and these models will be both based on classical Turing machines and the notion of representations.

35 References

On the complexity of real functions

We establish a new connection between the two most common traditions in the theory of real computation, the Blum-Shub-Smale model and the computable analysis approach. We then use the connection to…

Computable Real-Valued Functions on Recursive Open and Closed Subsets of Euclidean Space

This paper combines together the two concepts, computability on abstract metric spaces and computability for continuous functions, and delineate the basic properties of computable open and closed sets.

The Effective Riemann Mapping Theorem

Parity, circuits, and the polynomial-time hierarchy

A super-polynomial lower bound is given for the size of circuits of fixed depth computing the parity function and connections are given to the theory of programmable logic arrays and to the relativization of the polynomial-time hierarchy.

Computability on Regular Subsets of Euclidean Space

These reasonable notions for the computability of subsets of real numbers turn out to coincide for full-dimensional convex sets; but on the more general class of regular sets, they reveal rather interesting ’weaker/stronger’ relations.

Computable Analysis

Computable Analysis connects two traditionally disjoint fields, namely Analysis/Numerical Analysis on the one hand and Computability/Computational Complexity on the other hand, combining concepts of approximation and of computation.

Boundary Behaviour of Conformal Maps

1. Some Basic Facts.- 2. Continuity and Prime Ends.- 3. Smoothness and Corners.- 4. Distortion.- 5. Quasidisks.- 6. Linear Measure.- 7. Smirnov and Lavrentiev Domains.- 8. Integral Means.- 9. Curve…

Convergence of a Variant of the Zipper Algorithm for Conformal Mapping

Convergence for Jordan regions in the sense of uniformly close boundaries is proved and corresponding uniform estimates on the closed region and the closed disc for the mapping functions and their inverses are given.

Convergence of the Zipper algorithm for conformal mapping

In the early 1980's an elementary algorithm for computing conformal maps was discovered by R. K\"uhnau and the first author. The algorithm is fast and accurate, but convergence was not known. Given…

Principles Of Random Walk

This book is devoted exclusively to a very special class of random processes, namely to random walk on the lattice points of ordinary Euclidean space. The author considered this high degree of…