61
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Computational analytic continuation

      Preprint

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Holomorphic functions are amazing because their values in an ever so small disk in the complex plane completely determine the function values at arbitrary points in their maximum possible domain. The process of extending such a function beyond its initial domain is called analytic continuation. We attempt to make this theoretic result tractable by computers. In the present article, we first prove that any algorithm for analytic continuation can generally not depend on finitely many function values only, without closer inspection of the function itself. We then derive a computable local bound on the step size between sampling points which yields an algorithm for analytic continuation of complex plane algebraic curves. Finally, we provide a numerical example demonstrating its practical use.

          Related collections

          Author and article information

          Journal
          12 March 2014
          2015-05-14
          Article
          1403.2858
          f51f4a2d-e556-4d5c-ae1d-42fcf4ce6a83

          http://arxiv.org/licenses/nonexclusive-distrib/1.0/

          Custom metadata
          30B40 (primary), 14Q05, 30C15 (secondary)
          This paper is superseded by arXiv:1505.03432 [math.CV]
          math.CV math.AG

          Comments

          Comment on this article