SearcharxivSearch

arXiv subjects

Stefan Kranich

Publications and source records attributed to Stefan Kranich.

4 recordsLinked to original sources

An epsilon-delta bound for plane algebraic curves and its use for certified homotopy continuation of systems of plane algebraic curves

We explain how, given a plane algebraic curve $\mathcal{C}\colon f(x,y) = 0$, $x_1 \in \mathbb{C}$ not a singularity of $y$ w.r.t. $x$, and $\varepsilon > 0$, we can compute $δ> 0$ such that $|y_j(x_1) - y_j(x_2)| < \varepsilon$ for all holomorphic functions $y_j(x)$ which satisfy $f(x, y_j(x)) = 0$ in a neighbourhood of $x_1$ and for all $x_2$ with $|x_1 - x_2| < δ$. Consequently, we obtain an algorithm for reliable homotopy continuation of plane algebraic curves. As an example application, we study continuous deformation of closed discrete Darboux transforms. Moreover, we discuss a scheme for reliable homotopy continuation of triangular polynomial systems. A general implementation has remained elusive so far. However, the epsilon-delta bound enables us to handle the special case of systems of plane algebraic curves. The bound helps us to determine a feasible step size and paths, which are equivalent w.r.t. analytic continuation to the actual paths of the variables but along which we can proceed more easily.

math.CV

Generation of real algebraic loci via complex detours

We discuss the locus generation algorithm used by the dynamic geometry software Cinderella, and how it uses complex detours to resolve singularities. We show that the algorithm is independent of the orientation of its complex detours. We conjecture that the algorithm terminates if it takes small enough complex detours and small enough steps on every complex detour. Moreover, we introduce a variant of the algorithm that possibly generates entire real connected components of real algebraic loci. Several examples illustrate its use for organic generation of real algebraic loci. Another example shows how we can apply the algorithm to simulate mechanical linkages. Apparently, the use of complex detours produces physically reasonable motion of such linkages.

math.AG

GPU-based visualization of domain-coloured algebraic Riemann surfaces

We examine an algorithm for the visualization of domain-coloured Riemann surfaces of plane algebraic curves. The approach faithfully reproduces the topology and the holomorphic structure of the Riemann surface. We discuss how the algorithm can be implemented efficiently in OpenGL with geometry shaders, and (less efficiently) even in WebGL with multiple render targets and floating point textures. While the generation of the surface takes noticeable time in both implementations, the visualization of a cached Riemann surface mesh is possible with interactive performance. This allows us to visually explore otherwise almost unimaginable mathematical objects. As examples, we look at the complex square root and the folium of Descartes. For the folium of Descartes, the visualization reveals features of the algebraic curve which are not obvious from its equation.

cs.GR

Computational analytic continuation

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.

math.CV