Abstract
As a basic example in nonlinear theories of discrete complex analysis, we explore various numerical methods for the accurate evaluation of the discrete map \(Z^a\) introduced by Agafonov and Bobenko. The methods are based either on a discrete Painlevé equation or on the Riemann–Hilbert method. In the latter case, the underlying structure of a triangular Riemann–Hilbert problem with a nontriangular solution requires special care in the numerical approach. Complexity and numerical stability are discussed, the results are illustrated by numerical examples.
You have full access to this open access chapter, Download chapter PDF
Similar content being viewed by others
Keywords
 RiemannHilbert Problem
 Bobenko
 Discrete Complex Analysis
 Doublyinfinite Matrix
 Singular Integral Equations
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
1 Introduction
Following the famous ideas of Thurston’s for a nonlinear theory of discrete complex analysis based on circle packings, Bobenko and Pinkall [5] defined a discrete conformal map as a complex valued function \(f:\mathbb Z^2 \subset \mathbb {C}\rightarrow \mathbb {C}\) satisfying
That is, the cross ratio on each elementary quadrilateral (fundamental cell) of the lattice \(\mathbb Z^2\) is \(1\); infinitesimally, this property characterizes conformal maps among the smooth ones. A discrete conformal map \(f_{n,m}\) is called an immersion if the interiors of adjacent elementary quadrilaterals are disjoint.
A central problem in discrete complex analysis is to find discrete conformal analogues of classical holomorphic functions that are immersions; simply evolving just the boundary values of the classical function by (1) would not work [6]. To solve this problem, Bobenko [3] suggested to augment (1) by another equation: using methods from the theory of integrable systems it can be shown that the nonautonomous system of constraints
obtained as an integrable discretization of the differential equation
that would define \(f(z)=z^a\) up to scaling, is compatible with (1). Agafonov and Bobenko [1] proved that, for \(0<a<2\), the system (1) and (2) of recursions, applied to the three initial values
defines a unique discrete conformal map \(Z^a_{n,m} = f_{n,m}\) that is an immersion [1, Theorem 1].
Moreover, they showed [1, Sect. 3] that this discrete conformal map \(Z^a\) determines a circle pattern of Schramm type, i.e., an orthogonal circle pattern with the combinatorics of the square grid, see Fig. 1. They conjectured, recently proved by Bobenko and Its [4] using the Riemann–Hilbert method, that asymptotically
with the constant
For \(0<a\leqslant 1\), as exemplified in Fig. 1, this asymptotics is already accurate to plotting accuracy for all but the very smallest values of n and m. If \(a\rightarrow 2\), however, it requires increasingly larger values of n and m to become accurate.
In this work we study the stable and accurate numerical calculation of \(Z^a\); to the best of our knowledge for the first time in the literature. This is an interesting mathematical problem in itself, but the underlying methods should be applicable to a large set of similar discrete integrable systems. Now, the basic difficulty is that the evolution of the discrete dynamical system (1) and (2), starting from the initial values (3), is numerically highly unstable, see Fig. 2.^{Footnote 1}
The support of the stencils of (1) and (2) has the form of a square and a fivepoint cross in the lattice \(\mathbb Z^2\), that is,
with the latter reducing to be dimensional along the boundary of \(\mathbb Z^2_+\), namely
if \(n=0\) or \(m=0\). Thus, the forward evolution can be organized as follows. If \(f_{n,m}\) is known for \(0\leqslant n,m \leqslant N\) the upper index N is increased to \(N+1\) according to:

(i)
use (2) to compute the boundary values \(f_{N+1,0}\) and \(f_{0,N+1}\);

(ii)
use (1) to compute the row \(f_{N+1,m}\), \(1\leqslant m \leqslant N\);

(iii)
use (1) to compute the column \(f_{n,N+1}\), \(1\leqslant n \leqslant N\);

(iv)
use (1) to compute the diagonal value \(f_{N+1,N+1}\).
It is this algorithm that gives the unstable calculation shown in Fig. 2. Alternatively, one could use (2) to calculate the row values \(f_{N+1,m}\), \(1\leqslant m \leqslant N1\), and column values \(f_{n,N+1}\), \(1\leqslant n \leqslant N1\), up to the first sub and superdiagonal (note that these calculations do not depend on order within the rows and columns). The missing values are then completed by using (1). However, this alternative forward evolution gives a result that is visually indistinguishable from Fig. 2.
As can be seen from Fig. 2, the numerical instability starts spreading from the diagonal elements \(f_{n,n}\). In fact, there is an initial exponential growth of numerical errors to be found in the diagonal entries, see Fig. 3. Such a numerical instability of an evolution is the direct consequence of the instability of the underlying dynamical system, that is, of positive Lyapunov exponents.
As a remedy we suggest two different approaches to calculating \(Z^a_{n,m}\). In Sect. 2 we stabilize the calculation of the diagonal values by solving a boundary value problem for an underlying discrete Painlevé II equation and in Sects. 3–8 we explore numerical methods based on the Riemann–Hilbert method. The latter reveals an interesting structure (Sect. 4): the Riemann–Hilbert problem has triangular data but a nontriangular solution; the operator equation can thus be written as a uniquely solvable block triangular system where the infinitedimensional diagonal operators are not invertible. We discuss two different ways to prevent this particular structure from hurting finitedimensional numerical schemes: a coefficientbased spectral method with infinitedimensional linear algebra in Sect. 6 and a modified Nyström method based on least squares in Sect. 8.
2 Discrete Painlevé II Separatrix as a Boundary Value Problem
Since the source of the numerical instability of the direct evolution of the discrete dynamical system (1) and (2) is found in the diagonal elements \(f_{n,n}\), we first express the \(f_{n,n}\) directly in terms of a onedimensional threeterm recursion and then study its stable numerical evaluation. To begin with, Agafonov and Bobenko [1, Proposition 3] proved that the geometric quantities
have invariant magnitude \(x_n=1\) (see the circle packing in Fig. 1) and that they satisfy the following form of the discrete Painlevé II equation
with initial value \(x_0 = e^{ia \pi /4}\). Note that for \(n=0\) this nonlinear threeterm recurrence degenerates and gives the missing second initial value, namely
Reversely, given the solution \(x_n\) of this equation, the diagonal elements \(f_{n,n}\) can be calculated according to the simple recursion [1, p. 176]
with inital values \(g_0 = 0\), \(r_0=1\) (note that \(u_n\), \(r_n\), \(g_n\) are all positive); the sub and superdiagonal elements \(f_{n+1,n}\) and \(f_{n,n+1}\) are obtained from (1) and (5) by
However, given that \(x_n\) is a separatrix solution of the discrete Painlevé II equation [1, p. 167], we expect that a forward evolution of (6), starting with the initial values \(x_0\) and \(x_1\), suffers from exactly the same instability as the calculation of the diagonal values \(f_{n,n}\) by evolving (1) and (2). Figure 3 shows that this is indeed the case, exhibiting the same initial exponential growth rate; it also shows that the deviation of the calculated values of \(x_n\) from its invariant value 1 can serve as an explicitly computable error indicator.
In the continuous case of the Hastings–McLeod solution of Painlevé II, which also constitutes a separatrix, Bornemann [8, Sect. 3.2] suggested to address such problems by solving an asymptotic twopoint boundary value problem instead of the originally given evolution problem. To this end, one has to solve the connection problem first, that is, one has to establish the asymptotics of \(x_n\) as \(n\rightarrow \infty \). By inserting the known asymptotics (4) of \(Z_{n,m}^a\) into the defining Eq. (5), we obtain
Since in actual numerical calculations we need accurate approximations already for moderately large n, we match the coefficients of an expansion in terms of \(n^{1}\) to the discrete Painlevé II equation (6) and get, as \(n\rightarrow \infty \),
We denote the r.h.s. of this asymptotic formula, without the \(O(n^{6})\) term, by \(x_{n,6}\).
Next, using Newton’s method, we solve the nonlinear system of \(N+1\) equations in \(N+1\) unknowns \(x_0,\ldots ,x_N\) given by the discrete Painlevé equation (6) for \(1\leqslant n \leqslant N1\) and the two boundary conditions
Note that the value \(x_0 = e^{ia\pi /4}\) is not explicitly used and must be obtained as output of the Newton solve, that is, it can be used as an measure of success. We choose N large enough that \(x_{N,6} \doteq 1 \) up to machine precision (about \(N\approx 300\) uniformly in a). Then, using the excellent initial guesses (for the accuracy of the asymptotics cf. the left panel of Fig. 1)
Newton’s method will converge in about just 10 iterations to machine precision yielding a numerical solution that satisfies the invariant \(x_n=1\) also up to machine precision. Since the Jacobian of a nonlinear system stemming from a threeterm recurrence is tridiagonal, each Newton step has an operation count of order O(N). Hence, the overall complexity of accurately calculating the values \(x_n\), \(0\leqslant n \leqslant N\), is of optimal order O(N).
Finally, having accurate values of \(x_n\) at hand, and therefore by (8) and (9) also those of \(f_{n,n}\), \(f_{n+1,n}\) and \(f_{n,n+1}\), one can calculate the missing values of \(f_{n,m}\) row and columnwise, starting from the second sup and superdiagonal and evolving to the boundary, either by evolving the crossratio relations (1) or by evolving the discrete differential equation (2). It turns out that the first option develops numerical instabilities spreading from the boundary, see Fig. 4, whereas the second option is, for a wide range of the parameter a, numerically observed to be perfectly stable, see Fig. 5. Note that this stable algorithm only differs from the alternative direct evolution discussed in the introduction in how the values close to the diagonal, that is \(f_{n,n}\), \(f_{n+1,n}\) and \(f_{n,n+1}\), are computed.
The total complexity of this stable numerical calculation of the array \(f_{n,m}\) with \(0\leqslant n,m \leqslant N\) is of optimal order \(O(N^2)\).
3 The Riemann–Hilbert Method
Based on the integrability of the system (1) and (2), by identifying (1) as the compatibility condition of a Lax pair of linear difference equations [5] and by using isomonodromy, Bobenko and Its [4, p. 15] expressed the \(Z^a\) map in terms of the following Riemann–Hilbert problem (which is a slightly transformed and transposed version of the XRHP by these authors): Let \(\varGamma _1\) be the oriented contour built of two nonintersecting circles in the complex plane centered at \(z=\pm 1\) (see Fig. 6 left), the holomorphic function \(X: \mathbb {C}\setminus \varGamma _1 \rightarrow {{\mathrm{GL}}}(2)\) satisfies the jump condition
with the jump matrix^{Footnote 2}
subject to the following normalization
Here, we restrict ourselves to values of n and m having the same parity such that \((m+n)/2\) is an integer. The discrete \(Z^a\) map is now given by the values \(f_{n,m}\) extracted from an LUdecomposition at \(z=0\), namely,
that is,
Subsequently, using the Deift–Zhou nonlinear steepest decent method, Bobenko and Its [4] transform this XRHP to a series of Riemann–Hilbert problems that are more suitable for asymptotic analysis. The last one of this series before introducing a global parametrix,^{Footnote 3} the SRHP [4, pp. 24–27], is based on the contour shown in the left part of Fig. 7. This rather elaborate SRHP is, after normalizing at \(z=0\) and \(z\rightarrow \infty \) appropriately, amenable to the spectral collocation method of Olver [18]; we skip the details which can be found in the thesis of the fourth author G.W. [24, Sect. 5.4] that extends previous work on automatic contour deformation by Bornemann and Wechslberger [10, 25]. Here, the relative size of the inner and outer circles shaping the contour system shown in the right part of Fig. 7 have to be carefully adjusted to the parameters n and m to keep the condition number at a reasonable size. The complexity of computing \(f_{n,m}\) for fixed n and m is then basically independent of m and n.
In the rest of this work we explore to what extent the analytic transformation from the XRHP to the SRHP is a necessary preparatory step also numerically, or whether one can use the originally given XRHP as the basis for numerical calculations. To this end, we replace the normalization (10c) by the standard one, that is,
and introduce a further circle \(\varGamma _2\) as shown in the right part of Fig. 6 with the jump condition
We define \(\varGamma = \varGamma _1 \cup \varGamma _2\) and put \(G(\zeta ) = G_j(\zeta )\) for \(\zeta \in \varGamma _j\) (\(j=1,2\)). That way, the RiemannHilbert problem is given in the standard form
Because of \(\det G = 1\), the solution \(X \in C^\omega (\mathbb {C}\setminus \varGamma , {{\mathrm{GL}}}(2))\) is unique, see [12, p. 104].
4 Lower Triangular Jump Matrices and Indices
We note that the jump matrix G defined in (10b) and (10e) is lower triangular. However, even though the nonsingular lower triangular matrices form a multiplicative group and the normalization at \(z\rightarrow \infty \) is also lower triangular, the solution X turns out to not be lower triangular. Arguably the most natural source of RHPs exhibiting this structure are connected to orthogonal polynomials. By renormalizing at \(z\rightarrow \infty \) the standard RHP for the system of orthogonal polynomials on the unit circle with complex weight \(e^z\), we are led to consider the following model problem (\(m\in \mathbb N\))^{Footnote 4}:
Though one could perform a set of transformations to this problem that are standard in the RHP approach to the asymptotics of orthogonal polynomials on the circle, basically resulting in an analogue of the SRHP of [4], our point here is to understand the issues of a direct numerical approach to the XRHP (11) in a simple model case. It is straightforward to check that the unique solution of (12) is given explicitly by
with
where \(\varGamma (z)\) and \(\varGamma (k,z)\) denote the Gamma function and the incomplete Gamma function. In particular, we observe that \(Y_{12}(0)=1 \ne 0\).
The nontrivial 12component v of a Riemann–Hilbert problem with lower triangular jump matrices, such as (11) or (12), can be expressed independently of the other components, it satisfies a homogeneous scalar Riemann–Hilbert problem of its own. Namely, denoting the 11component of G by g, we get
If the contour is a cycle as in (11), or as in the model problem above, the general theory [17, Sect. 127] of Riemann–Hilbert problems with Hölder continuous boundary regularity states that the Noether index^{Footnote 5} \(\kappa \) of (14) is given by the winding number
More precisely, the nullity is the sum of the positive partial indices and the deficiency is the sum of the magnitudes of the negative partial indices, see [17, Eq. (127.30)]. Since there is just one partial index in the scalar case, the nullity of (14) is \(\kappa \) if \(\kappa >0\), and the deficiency is \(\kappa \) if \(\kappa <0\).
Thus, in the case of the RHP (11), the nullity of the scalar subRHP for the 12component is
in the case of the model RHP (12) the corresponding nullity is m. In both cases, the unique nonzero solution of (14) that is induced by the solution of the defining \(2\times 2\) RHP is precisely selected by the compatibility conditions set up by the remaining linear relations of that RHP: the homogeneous part of these relations must then have Noether index \(\kappa \).
Impact on Numerical Methods
This particular substructure of a Riemann–Hilbert problem with lower triangular jump matrices G is a major challenge for numerical methods. If a discretization of the \(2\times 2\) RHP induces a discretization of the scalar subproblem (14) that results in a homogeneous linear system with a square matrix \(S_N\) (that is, the same number of equations and unknowns), there are just two (non exclusive) options:

\(S_N\) is nonsingular, which results in a 12component \(v_N = 0\) that does not converge;

the full system is singular and therefore numerically of not much use (illconditioning and convergence issues will abound).
Such methods compute fake lower triangular solutions, are illconditioned, or both.
To understand this claim, let us denote the 12component of the \(2\times 2\) discrete solution matrix by \(v_N\) and the vector of the three other components by \(w_N\). By inheriting the subproblem structure such as (14) for the 12component, the discretization results then in a linear system of the block matrix form
Because of \(\det (A_N) = \det (S_N)\det (T_N)\) a nonsingular discretization matrix \(A_N\) implies a nonsingular \(S_N\) and, thus, a nonconvergent trivial component \(v_N=0\). Such a nonconvergent zero 12component is what one gets, for example, if one applies the spectral collocation method of [18] (with square contours replacing the circles) to the Riemann–Hilbert problems (11) or to the model problem (14). As a hint of failure, the resulting discrete system is illconditioned; details which can be found in the thesis of the fourth author G.W. [24, Sect. 5.4].
The deeper structural reason for this problem can be seen in the fact that the Noether index of finitedimensional square matrices is always zero, whereas the index of the infinitedimensional subproblem (14) is strictly positive.
We suggest two approaches to deal with this problem: first, an infinitedimensional discretization using sequence spaces, that is, without truncation, and using infinitedimensional numerical linear algebra, and second, using underdetermined discretizations with rectangular linear systems that are complemented by a set of explicit compatibility conditions.
5 RHPs as Integral Equations with Singular Kernels
In this section, we recall a way to express the RHP (11), with standard normalization at infinity, as a particular system of singular integral equations, cf. [11, 16, 18]. We introduce the Cauchy transform
and their directional limits \(C_\pm \) when approaching the left or right of the oriented contour \(\varGamma \), defined by
Note that \(C_\pm \) can be extended as bounded linear operators mapping \(L^2(\varGamma )\) (or spaces of Hölder continuous functions) into itself, and C (suitably extended) maps such functions into functions that are holomorphic on \(\mathbb {C}\setminus \varGamma \), see [12, p. 100]. By using the decomposition \(C_+  C_ = {{\mathrm{id}}}\), the ansatz (by letting C act componentwise on the matrixvalued function u)
establishes the equivalence of a RHP of the form (11) and the system of singular integral equations
As the following theorem shows, singular integral operators of the form
can be preconditioned by operators of exactly the same form.
Theorem 1
Let \(\varGamma \) be a smooth, bounded, and nonself intersecting^{Footnote 6} contour system and \(G:\varGamma \rightarrow {{\mathrm{GL}}}(2)\) a system of jump matrices which continues analytically to a vicinity of \(\varGamma \). Then, \(T_{G^{1}}\) is a Fredholm regulator of \(T_G\), that is, \(T_{G^{1}} T_G = {{\mathrm{id}}} + K\) with a compact operator \(K : L^2(\varGamma ,\mathbb {C}^{2\times 2}) \rightarrow L^2(\varGamma ,\mathbb {C}^{2\times 2})\) that can be represented as a regular integral operator.
Proof
The Sokhotski–Plemelj formula [17, Eq. (17.2)] gives that \(2C_ = {{\mathrm{id}}} + H\), where H denotes a variant of the Hilbert transform (normalized as in [17]),
with the integral understood in the sense of principle values. This way, we have
By a product formula of Muskhelishvili [17, Eq. (130.15)], which directly follows from the Poincaré–Betrand formula [17, Eq. (23.8)], one has
where K represents a regular integral operator and the coefficient matrices A and B are given by the expressions
Here, we thus obtain \(A=I\) and \(B=0\), which finally proves the assertion. \(\square \)
This theorem implies that the operator \(T_{G}\) is Fredholm, that is, its nullity and deficiency are finite. In fact, since in our examples \(\det G \equiv 1\), we have that the Noether index of \(T_G\) is zero. The possibility to use the Fredholm theory is extremely important in studying RHPs: it allows one to use, when proving the solvability of RiemannHilbert problems, the “vanishing lemma” [26], see also [12, Chap. 5]. For the use of Fredholm regulators in iterative methods applied to solving singular integral equations, see [23].
6 A WellConditioned Spectral Method for Closed Contours
We follow the ideas of Olver and Townsend [20] on spectral methods for differential equations, recently extended by Olver and Slevinsky [19] to singular integral equations. First, the solution u and the data \(GI\) of the singular integral equation (15b) are expanded^{Footnote 7} in the Laurent bases of the circles that built up the cycle \(\varGamma \). Next, the resulting linear system is solved using the framework of infinitedimensional linear algebra [14, 21], built out of the adaptive QR factorization introduced in [20].
To be specific, we describe the details for the model RHP (12), where the cycle \(\varGamma \) is just the unit circle. Here, we have the expansions
both rapidly decaying with \(2\times 2\) coefficient matrices \(U_k\) and \(A_k\). In the Laurent basis, the operator \(C_\) acts diagonally in the simple form
which gives
Note that \(C_\) acts as a projection to the subspace spanned by the basis elements with negative index. This way, the system (15b) of singular integral equations is transformed to^{Footnote 8}
Up to a given accuracy, we may assume that the data is given as a finite sum,
likewise for \(G^{1}(\zeta )  I\) with a truncation at \(n_2\). Thus, writing the discrete system (16) in matrixvector form, the corresponding doubleinfinite matrix has a bandwidth of order \(O(n_1)\). Preconditioning this system, following Theorem 1, by the multiplication with the doubleinfinite matrix belonging to \(G^{1}\) instead of G, results in a doubleinfinite matrix that has a bandwidth of order \(O(n_1+n_2)\). Since the right hand side of (16) is truncated at indices of magnitude \(O(n_1)\), application of the adaptive QR factorization [20], after reordering the doubleinfinite coefficients as \(U_0,U_{1},U_1,\ldots \) in order to be singly infinite, will result in an algorithm that has a complexity of order \(O((n_1+n_2)^2 n_3)\), where \(n_3\) is the number of coefficients needed to resolve u, dictated by a specified tolerance.
Remark 1
The extension to systems \(\varGamma \) of closed contours built from several circles is straightforward. The jump data and the solution, restricted to a circle centered at a are expanded in the Laurent basis \((za)^k\), \(k\in \mathbb Z\). When instead evaluated at a circle centered at b, a change of basis is straightforwardly computed using
valid for \(zb < ba\). Because of a geometric decay, one can truncate those series at \(k = O(1)\) as long as \(zb < \theta ba\) with \(0<\theta < 1\) small enough. The adaptive QR factorization can then be applied by interlacing the Laurent coefficients on each circle to obtain a singly infinite unknown vector of coefficients.
Numerical Example 1: Model problem
Because of the entries \(\zeta ^m\) and \(\zeta ^{m}\) in the jump matrix of the model problem (12), we have that \(n_1, n_2, n_3 = O(m)\) in order to resolve the data and the solution; hence the computational complexity of the method scales as \(O(m^3)\). Using the Julia software package SingularIntegralEquations.jl ^{Footnote 9} (v0.0.1) the problem is numerically solved by the following short code showing that the user has to do little more than just providing the data and entering the singular integral equation (15b) as a mathematical expression:
The run time^{Footnote 10} is 2.8 seconds, the error of Y(0) is \(4.22\cdot 10^{15}\) (spectral norm), which corresponds to a loss of one digit in absolute error.
Numerical Example 2: Riemann–Hilbert Problem for the Discrete \(\mathbf Z ^{2/3}\)
Now, we apply the method to the Riemann–Hilbert problem (11) encoding the discrete \(Z^a\) map. Here, because of the exponents \(m\), \(n\) and \(\pm (n+m)/2\) in (10), we have \(n_1, n_2, n_3 = O(n+m)\) in order to resolve the data and the solution, see Fig. 8; hence the computational complexity scales as \(O((n+m)^3)\). Note that this is far from optimal, using the stabilized recursion of Sect. 2 to compute a table including \(Z_{n,m}^a\) would give a complexity of order \(O((n+m)^2)\). Once more, however, the code requires little more than typing the mathematical equations of the RHP.
The run time is 2.7 s, the absolute error of \(Z^{2/3}_{6,8}\) is \(3.38\cdot 10^{8}\), which corresponds to a loss of about 7 digits. This loss of accuracy can be explained by comparing the magnitude of the 21component of u as shown in Fig. 8, along the two black circles of Fig. 6, with that of the corresponding component of the solution matrix at \(z=0\), namely,
We observe that during the evaluation of the Cauchy transform (15a), which maps \(u\mapsto X(0)\) by means of an integral, at least 5 digits must have been lost by cancellation—a loss, which structurally cannot be avoided for oscillatory integrands with large amplitudes. (Note that this is not an issue of frequency: just one oscillation with a large amplitude suffices to get such a severe cancellation.)
Since the amplitudes of \(u_{21}\) grow exponentially with n and m, the algorithm for computing \(Z^a_{n,m}\) based on the numerical evaluation of (15) applied to the RHP (11) is numerically unstable. Even though the initial step, the spectral method in coefficient space applied to (15b) is perfectly stable, stability is destructed by the bad conditioning of the postprocessing step, that is, the evaluation of the integral in (15a). We refer to [7] for an analysis that algorithms with a badly conditioned post processing of intermediate solutions are generally prone to numerical instability.
7 RHPs as Integral Equations with Nonsingular Kernels
By reversing the orientation of the two small circles in the RHP (11), and by simultaneously replacing the jump matrix \(G_1\) by \(\tilde{G}_1 = G_1^{1}\), the RHP is transformed to an equivalent one with a contour system \(\Sigma \) that satisfies the following properties, see Fig. 9: it is a union of nonself intersecting smooth curves, that bound a domain \(\Omega _+\) to its left. By \(\Omega _\) we will denote the (generally not connected) region which is the complement of \(\Omega _+ \cup \varGamma \). Note that the model problem (12) falls into that class of contours without any further transformation.
We drop the tilde from the jump matrices and consider RHPs of the form
on such contours systems \(\Sigma \). It will either represent the aforementioned transformation of (11) or the model problem (12). In particular, G is lower triangular and can be analytically continued to a vicinity of \(\Sigma \).
The classical theory developed by Plemelj (see [17, Sect. 126]) for such problems teaches the following: the directed boundary values \(\varPhi _\) of the unique analytic solution \(\varPhi : \mathbb {C}\setminus \Sigma \rightarrow {{\mathrm{GL}}}(2)\) of the RHP (17) satisfy a Fredholm integral equation [17, Eq. (126.5)] of the second kind on \(\Sigma \), namely
understood here as an integral equation in \(L^2(\Sigma ,\mathbb {C}^{2\times 2})\). The matrix kernel of this equation, that is,
is smooth on \(\Sigma \times \Sigma \), since it extends as an analytic function and since the singularity at \(\zeta =\eta \) is removable. Integral equations of the form (18) with a smooth kernel are, in principle, amenable to fast quadrature based methods, see the next section.
We note that, given the boundary values \(\varPhi _(\zeta )\) for \(\zeta \in \Sigma \), the solution of the RHP (17) can be reconstructed by
In general, however, the Fredholm equation (18) is not equivalent to the RHP, see [17, p. 387]: the Fredholm equation has but a kernel of the same dimension as the kernel of the associated homogeneous RHP, defined as
As we will show now, the kernel of the associated RHP is nontrivial in the examples studied in this work.
First, we observe, by the lower triangular form of G, that the 11 and the 12components of \(\varPsi \) both satisfy a scalar RHP of the form (14) with a jump function g that has a winding number which is
for the discrete map \(Z^a\), and which is \({{\mathrm{ind}}}_\Sigma g = m\) for the model problem (12). Note that this winding number has the sign opposite to the results of Sect. 4 since the underlying \(2\times 2\) RHP is based on \(G^{1}\) instead of G. Hence, the nullity of the scalar RHPs for the 11 and the 12components of \(\varPsi \) is zero and the deficiency is \((n+m)/2\) (m in case of the model problem). As a consequence, the 11 and the 12components of \(\varPsi \) must both be identically zero.
Next, since we now know that \(\varPsi \) has a zero first row, also the 21 and 22components of \(\varPsi \) satisfy a scalar RHP of the form (14) each, but with a jump function g that has the positive winding number
for the discrete map \(Z^a\), and \({{\mathrm{ind}}}_\Sigma g = m\) for the model problem (12), just as discussed in Sect. 4. Hence, the deficiency of the scalar RHPs for the 21 and the 22components of \(\varPsi \) is zero and the nullity is \((n+m)/2\) (m in case of the model problem). Since both components are linearly independent from of each other, we have thus proven the following lemma.
Lemma 1
The nullity of the associated homogeneous RHP (20), and hence, that of the Fredholm integral equation (18) is \(n+m\) in the case of the discrete map \(Z^a\) and 2m in the case of the model problem (12).
Example 1
For the model RHP (12) the smooth kernel of the Fredholm integral equation (18) can be constructed explicitly. Here we have
A column of a matrix belonging to the kernel of (18) satisfies the equation
where \(\Sigma \) is the positively oriented unit circle. We will construct solutions that extend analytically as \(u_(z)\) and \(w_(z)\) for \(z\ne 0\), such that
By recalling the notation introduced in (13) we observe, for \(k=0,\ldots ,m1\), that
Using the coefficients \(a_{jk}^{(m)}\) that induce a change of polynomial basis by
we define the polynomials
each of which has degree at most \(m1\). Then, the m linear independent vectors
are solutions of (21) each. Thus, since its dimension is 2m by Lemma 1, the kernel of the integral equation (18) is spanned by the \(2\times 2\) matrices whose columns are linear combinations of these vectors. \(\square \)
The unique solution \(\varPhi _\) of the RHP (17) can be picked among the solutions of (18) by imposing additional linear conditions, namely \(n+m\) independent such conditions in the case of the discrete map \(Z^a\) and 2m in the case of the model problem. Specifically, for the model problem (12), we obtain such conditions as follows. First, since \(\varPhi _(z)\) continues analytically to \(z>1\) and since \(\varPhi _(z) = I + O(z^{1})\) as \(z\rightarrow \infty \), we get by Cauchy’s formula for the Laurent coefficients at \(z=\infty \) that
Second, by restricting this relation to the second row of the matrix \(\varPhi _\) for \(k=1,\ldots ,m\), we get the conditions
In fact, these conditions force all the components of the columns (22) that would span an offset from the kernel of (18) to be zero.
For the \(Z^a\)RHP, similar arguments prove that the kernel of (17) is spanned by matrices whose second row extends to polynomials of degree smaller than \((n+m)/2\) to the outside of the outer circle in Fig. 9. Thus, the same form of conditions as in (23) can be applied for picking the proper solution \(\varPhi _(\zeta )\), except that one would have to replace \(\Sigma \) by that outer circle and the upper index m by \((n+m)/2\).
8 A Modified Nyström Method
Fredholm integral equations of the second kind with smooth kernels defined on a system of circular contours are best discretized by the classical Nyström method [15, Sect. 12.2]. Here, one uses the composite trapezoidal rule as the underlying quadrature formula, that is,
For integrands that extend analytically to a vicinity of the contour, this quadrature formula is spectrally accurate, see, e.g., [9, \(\S \)2] or [22, \(\S \)2].
Since the Fredholm integral equation (18) has a positive nullity, applying the Nyström method to it will yield, for N large enough, a numerically singular linear system. However, the theory of the last section suggests a simple modification of the Nyström method: we use the conditions (23) (after approximating them by the same quadrature formula as for the Nyström method) as additional equations and solve the resulting overdetermined linear system by the least squares method.
Numerical Example 1: Model problem
We apply the modified Nyström method to the Fredholm integral equation representing the model problem (12). By the sampling condition, see, e.g., [9, \(\S \)2], the number N of quadrature points will scale as \(N = O(m)\), hence the computational complexity scales as \(O(m^3)\). To check the accuracy we compare with
evaluated by the same quadrature formula as for the Nyström method. For the particular parameters \(m=100\) and \(N=140\) we get, within a runtime of 0.49 s for a straightforward Matlab implementation, a maximum error of these two quantities, measured in 2norm, of \(1.33\cdot 10^{14}\). The condition number of the least squares matrix grows just moderately with m: it is about 23 for \(m=1\) and about 650 for \(m=1000\).
Numerical Example 2: Discrete \(Z^{2/3}\)
Now, we apply the modified Nyström method to the Fredholm integral equation representing the RHP (11) subject to a transformation to the form (17). Here, the sampling condition requires \(N = O(n+m)\), hence the computational complexity scales as \(O((n+m)^3)\). For \(Z_{6,8}^{2/3}\), the modified Nyström method yields the convergence plot shown in Fig. 10: it exhibits exponential (i.e., spectral) convergence until a noise level of about \(10^{9}\) is reached, which corresponds to a loss of about 6 digits. The reason for this loss is that this method for approximating the discrete \(Z^a\) suffers the same issue with a bad conditioning of the postprocessing step, that is, of
as the spectral method for the singular integral equation discussed in Sect. 6. Here, the amplitude of the real and imaginary part of \(\varPhi _(\zeta )\) along the two inner circles is of the order \(10^4\) which causes a cancellation of at least 4 significant digits.
9 Conclusion
To summarize, there are two fundamental options for the stable numerical evaluation of the discrete map \(Z^a_{n,m}\).

Computing all the values of the array \(1\leqslant n,m\leqslant N\) at once by, first, computing the diagonal using a boundary value solve for the discrete Painlevé II equation (5) and, then, by recursing from the diagonal to the boundary using the discrete differential equation (2). This approach has optimal complexity \(O(N^2)\).

Computing just a single value for a given index pair (n, m) by using the RHP (11) and one of the methods discussed in Sect. 6 or 8. Since both methods suffer from an instability caused by a postprocessing quadrature for larger values of n and m, one would rather mix this approach with the asymptotics (4). For instance, using the numerical schemes for \(n,m \leqslant 10\), and the asymptotics otherwise, gives a uniform precision of about 5 digits for \(a=2/3\). Higher accuracy would require the calculation of the next order terms of the asymptotics as in Sect. 2. This mixed numericalasymptotic method has optimal complexity O(1).
Notes
 1.
All numerical calculations are done in hardware arithmetic using double precision.
 2.
To make \(G_1\) holomorphic in the vicinity of \(\varGamma _1\) we place the branchcut of \(\zeta ^{a/2}\) at the negative imaginary axis, that is, we take, using the principal branch \({{\mathrm{Log}}}\) of the logarithm,
$$ e^{ia \pi /2} \zeta ^{a/2} = e^{ia \pi /4} e^{\frac{a}{2} {{\mathrm{Log}}}(\zeta /i)}. $$.
 3.
Though the parametrix leads to a nearidentity RHP, the actually computation of the parametrix would require solving a problem that is, numerically, of similar difficulty as the SRHP itself.
 4.
The standard form, see [2, p. 1124], of that orthogonal polynomial RHP would be
$$ X_+(\zeta ) = \begin{pmatrix} 1 &{} 0\\ e^\zeta \zeta ^{m} &{} 1 \end{pmatrix} X_(\zeta )\quad (\zeta =1),\qquad X(z) = \begin{pmatrix} z^m &{} 0 \\ 0 &{} z^{m} \end{pmatrix}(I+O(z^{1}))\qquad (z\rightarrow \infty ). $$The model problem (12) is obtained by putting the diagonal scaling at \(z\rightarrow \infty \) into the jump matrix.
 5.
Here, we identify a RHP with an equivalent linear operator equation \(Tu = \cdots \), see, e.g., (15) in the next section. We recall that \(\lambda = \dim \ker T\) is called the nullity, \(\mu = \dim {{\mathrm{coker}}}T\) the deficiency and \(\kappa = \lambda  \mu \) the Noether index of a linear operator T with closed range.
 6.
Points of self intersection are allowed if certain cyclic conditions are satisfied [13]: at such a point the product of the corresponding parts of the jump matrix should be the identity matrix. These conditions guarantee smoothness in the sense of [26], where the analog of Theorem 1 is proved for the general smooth Riemann–Hilbert data.
 7.
It is actually implemented this way in SingularIntegralEquations.jl, a Julia software package described in [19].
 8.
We use the Iverson bracket of a condition: \([{\mathscr {P}}] = 1\) if the predicate \({\mathscr {P}}\) is true, \([{\mathscr {P}}] = 0\) otherwise.
 9.
https://github.com/ApproxFun/SingularIntegralEquations.jl, cf. [19].
 10.
Using a MacBook Pro with a 3.0 GHz Intel Core i74578U processor and 16 GB of RAM.
References
Agafonov, S.I., Bobenko, A.: Discrete \(Z^\gamma \) and Painlevé equations. Int. Math. Res. Notices 2000(4), 165–193 (2000)
Baik, J., Deift, P., Johansson, K.: On the distribution of the length of the longest increasing subsequence of random permutations. J. Am. Math. Soc. 12(4), 1119–1178 (1999)
Bobenko, A.: Discrete conformal maps and surfaces. Symmetries and Integrability of Difference Equations (Canterbury. 1996), London Mathematical Society Lecture Note Series, vol. 255, pp. 97–108. Cambridge University Press, Cambridge (1999)
Bobenko, A., Its, A.: The asymptotic behaviour of the discrete holomorphic map \(Z^a\) via the Riemann–Hilbert method (2014). arXiv:1409.2667
Bobenko, A., Pinkall, U.: Discrete isothermic surfaces. J. Reine Angew. Math. 475, 187–208 (1996)
Bobenko, A., Pinkall, U.: Discretization of surfaces and integrable systems. Discrete Integrable Geometry and Physics (Vienna, 1996). Oxford Lecture Series in Mathematics and Its Applications, vol. 16, pp. 3–58. Oxford University Press, New York (1999)
Bornemann, F.: A model for understanding numerical stability. IMA J. Numer. Anal. 27(2), 219–231 (2007)
Bornemann, F.: On the numerical evaluation of distributions in random matrix theory: a review. Markov Process. Rel. Fields 16(4), 803–866 (2010)
Bornemann, F.: Accuracy and stability of computing highorder derivatives of analytic functions by Cauchy integrals. Found. Comput. Math. 11(1), 1–63 (2011)
Bornemann, F., Wechslberger, G.: Optimal contours for highorder derivatives. IMA J. Numer. Anal. 33(2), 403–412 (2013)
Deift, P., Zhou, X.: A priori \(L^p\)estimates for solutions of RiemannHilbert problems. Int. Math. Res. Not. 40, 2121–2154 (2002)
Fokas, A.S., Its, A.R., Kapaev, A.A., Novokshenov, V.Y.: Painlevé TranscendentsThe RiemannHilbert Approach. American Mathematical Society, Providence (2006)
Fokas, A.S., Zhou, X.: On the solvability of Painlevé II and \({\rm{IV}}\). Comm. Math. Phys. 144(3), 601–622 (1992)
Hansen, A.C.: Infinitedimensional numerical linear algebra: theory and applications. Proc. R. Soc. Lond. Ser. A Math. Phys. Eng. Sci. 466(2124), 3539–3559 (2010)
Kress, R.: Linear Integral Equations, vol. 82, 3rd edn. Springer, New York (2014)
Litvinchuk, G.S., Spitkovskii, I.M.: Factorization of Measurable Matrix Functions. Birkhäuser Verlag, Basel (1987)
Muskhelishvili, N.I.: Singular Integral Equations. WoltersNoordhoff Publ, Groningen (1972)
Olver, S.: A general framework for solving RiemannHilbert problems numerically. Numer. Math. 122(2), 305–340 (2012)
Olver, S., Slevinsky, R.M.: A fast and wellconditioned spectral method for singular integral equations (2015). arXiv:1507.00596
Olver, S., Townsend, A.: A fast and wellconditioned spectral method. SIAM Rev. 55(3), 462–489 (2013)
Olver, S., Townsend, A.: A practical framework for infinitedimensional linear algebra. In: Proceedings of the First Workshop for High Performance Technical Computing in Dynamic Languages, pp. 57–62 (2014)
Trefethen, L.N., Weideman, J.A.C.: The exponentially convergent trapezoidal rule. SIAM Rev. 56(3), 385–458 (2014)
Trogdon, T.: On the application of GMRES to oscillatory singular integral equations. BIT 55(2), 591–620 (2015)
Wechslberger, G.: Automatic Contour Deformation of Riemann–Hilbert Problems. Ph.D. thesis, Technische Universität München (2015)
Wechslberger, G., Bornemann, F.: Automatic deformation of RiemannHilbert problems with applications to the Painlevé II transcendents. Constr. Approx. 39(1), 151–171 (2014)
Zhou, X.: The RiemannHilbert problem and inverse scattering. SIAM J. Math. Anal. 20(4), 966–986 (1989)
Acknowledgments
The research of F.B., A.I., and G.W. was supported by the DFGCollaborative Research Center, TRR 109, “Discretization in Geometry and Dynamics.”
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Open Access This chapter is distributed under the terms of the Creative Commons AttributionNoncommercial 2.5 License (http://creativecommons.org/licenses/bync/2.5/) which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
The images or other third party material in this chapter are included in the work’s Creative Commons license, unless indicated otherwise in the credit line; if such material is not included in the work’s Creative Commons license and the respective action is not permitted by statutory regulation, users will need to obtain permission from the license holder to duplicate, adapt or reproduce the material.
Copyright information
© 2016 The Author(s)
About this chapter
Cite this chapter
Bornemann, F., Its, A., Olver, S., Wechslberger, G. (2016). Numerical Methods for the Discrete Map \(Z^a\) . In: Bobenko, A. (eds) Advances in Discrete Differential Geometry. Springer, Berlin, Heidelberg. https://doi.org/10.1007/9783662504475_4
Download citation
DOI: https://doi.org/10.1007/9783662504475_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 9783662504468
Online ISBN: 9783662504475
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)