Special values of multiple polylogarithms

Historically, the polylogarithm has attracted specialists and non-specialists alike with its lovely evaluations. Much the same can be said for Euler sums (or multiple harmonic sums), which, within the past decade, have arisen in combinatorics, knot theory and high-energy physics. More recently, we have been forced to consider multidimensional extensions encompassing the classical polylogarithm, Euler sums, and the Riemann zeta function. Here, we provide a general framework within which previously isolated results can now be properly understood. Applying the theory developed herein, we prove several previously conjectured evaluations, including an intriguing conjecture of Don Zagier

Experimental evidence for the Volume Conjecture for the simplest hyperbolic non-2-bridge knot

Loosely speaking, the Volume Conjecture states that the limit of the n-th colored Jones polynomial of a hyperbolic knot, evaluated at the primitive complex n-th root of unity is a sequence of complex numbers that grows exponentially. Moreover, the exponential growth rate is proportional to the hyperbolic volume of the knot. We provide an efficient formula for the colored Jones function of the simplest hyperbolic non-2-bridge knot, and using this formula, we provide numerical evidence for the Hyperbolic Volume Conjecture for the simplest hyperbolic non-2-bridge knot.Comment: Published by Algebraic and Geometric Topology at http://www.maths.warwick.ac.uk/agt/AGTVol5/agt-5-17.abs.htm

The functions erf and erfc computed with arbitrary precision and explicit error bounds

The version available on the HAL server is slightly different from the published version because it contains full proofs.International audienceThe error function erf is a special function. It is widely used in statistical computations for instance, where it is also known as the standard normal cumulative probability. The complementary error function is defined as erfc(x)=erf(x)-1. In this paper, the computation of erf(x) and erfc(x) in arbitrary precision is detailed: our algorithms take as input a target precision t' and deliver approximate values of erf(x) or erfc(x) with a relative error bounded by 2^(-t'). We study three different algorithms for evaluating erf and erfc. These algorithms are completely detailed. In particular, the determination of the order of truncation, the analysis of roundoff errors and the way of choosing the working precision are presented. The scheme used for implementing erf and erfc and the proofs are expressed in a general setting, so they can directly be reused for the implementation of other functions. We implemented the three algorithms and studied experimentally what is the best algorithm to use in function of the point x and the target precision t'

Computing the Exponential of Large Block-Triangular Block-Toeplitz Matrices Encountered in Fluid Queues

The Erlangian approximation of Markovian fluid queues leads to the problem of computing the matrix exponential of a subgenerator having a block-triangular, block-Toeplitz structure. To this end, we propose some algorithms which exploit the Toeplitz structure and the properties of generators. Such algorithms allow to compute the exponential of very large matrices, which would otherwise be untreatable with standard methods. We also prove interesting decay properties of the exponential of a generator having a block-triangular, block-Toeplitz structure

The Cauchy-Lagrangian method for numerical analysis of Euler flow

A novel semi-Lagrangian method is introduced to solve numerically the Euler equation for ideal incompressible flow in arbitrary space dimension. It exploits the time-analyticity of fluid particle trajectories and requires, in principle, only limited spatial smoothness of the initial data. Efficient generation of high-order time-Taylor coefficients is made possible by a recurrence relation that follows from the Cauchy invariants formulation of the Euler equation (Zheligovsky & Frisch, J. Fluid Mech. 2014, 749, 404-430). Truncated time-Taylor series of very high order allow the use of time steps vastly exceeding the Courant-Friedrichs-Lewy limit, without compromising the accuracy of the solution. Tests performed on the two-dimensional Euler equation indicate that the Cauchy-Lagrangian method is more - and occasionally much more - efficient and less prone to instability than Eulerian Runge-Kutta methods, and less prone to rapid growth of rounding errors than the high-order Eulerian time-Taylor algorithm. We also develop tools of analysis adapted to the Cauchy-Lagrangian method, such as the monitoring of the radius of convergence of the time-Taylor series. Certain other fluid equations can be handled similarly.Comment: 30 pp., 13 figures, 45 references. Minor revision. In press in Journal of Scientific Computin

Embedding approach to modeling electromagnetic fields in a complex two-dimensional environment

An approach is presented to combine the response of a two-dimensionally inhomogeneous dielectric object in a homogeneous environment with that of an empty inhomogeneous environment. This allows an efficient computation of the scattering behavior of the dielectric cylinder with the aid of the CGFFT method and a dedicated extrapolation procedure. Since a circular observation contour is adopted, an angular spectral representation can be employed for the embedding. Implementation details are discussed for the case of a closed 434 MHz microwave scanner, and the accuracy and efficiency of all steps in the numerical procedure are investigated. Guidelines are proposed for choosing computational parameters such as truncation limits and tolerances. We show that the embedding approach does not increase the CPU time with respect to the forward problem solution in a homogeneous environment, if only the fields on the observation contour are computed, and that it leads to a relatively small increase when the fields on the mesh are computed as well

Adaptive transient solution of nonuniform multiconductor transmission lines using wavelets

Abstract—This paper presents a highly adaptive algorithm for the transient simulation of nonuniform interconnects loaded with arbitrary nonlinear and dynamic terminations. The discretization of the governing equations is obtained through a weak formula-tion using biorthogonal wavelet bases as trial and test functions. It is shown how the multiresolution properties of wavelets lead to very sparse approximations of the voltages and currents in typical transient analyzes. A simple yet effective time–space adaptive al-gorithm capable of selecting the minimal number of unknowns at each time iteration is described. Numerical results show the high degree of adaptivity of the proposed scheme. Index Terms—Electromagnetic (EM) transient analysis, multi-conductor transmission lines (TLs), wavelet transforms. I