Tanh-sinh quadrature

From Wikipedia, the free encyclopedia

Tanh-sinh quadrature is a method for numerical integration introduced by Hidetoshi Takahashi and Masatake Mori in 1974.[1] It is especially applied where singularities or infinite derivatives exist at one or both endpoints.

The method uses hyperbolic functions in the change of variables

to transform an integral on the interval x ∈ (−1, 1) to an integral on the entire real line t ∈ (−∞, ∞), the two integrals having the same value. After this transformation, the integrand decays with a double exponential rate, and thus, this method is also known as the double exponential (DE) formula.[2]

For a given step size , the integral is approximated by the sum

with the abscissas

and the weights


The Tanh-Sinh method is quite insensitive to endpoint behavior. Should singularities or infinite derivatives exist at one or both endpoints of the (−1, 1) interval, these are mapped to the (−∞,∞) endpoints of the transformed interval, forcing the endpoint singularities and infinite derivatives to vanish. This results in a great enhancement of the accuracy of the numerical integration procedure, which is typically performed by the Trapezoidal rule. In most cases, the transformed integrand displays a rapid roll-off (decay), enabling the numerical integrator to quickly achieve convergence.

Like Gaussian quadrature, Tanh-Sinh quadrature is well suited for arbitrary-precision integration, where an accuracy of hundreds or even thousands of digits is desired. The convergence is exponential (in the discretization sense) for sufficiently well-behaved integrands: doubling the number of evaluation points roughly doubles the number of correct digits. However, Tanh-Sinh quadrature is not as efficient as Gaussian quadrature for smooth integrands; but unlike Gaussian quadrature, tends to work equally well with integrands having singularities or infinite derivatives at one or both endpoints of the integration interval as already noted. Furthermore, Tanh-Sinh quadrature can be implemented in a progressive manner, with the step size halved each time the rule level is raised, and reusing the function values calculated on previous levels. A further advantage is that the abscissas and weights are relatively simple to compute. The cost of calculating abscissa–weight pairs for n-digit accuracy is roughly n2 log2 n compared to n3 log n for Gaussian quadrature.

Bailey and others have done extensive research on Tanh-Sinh quadrature, Gaussian quadrature and Error Function quadrature, as well as several of the classical quadrature methods, and found that the classical methods are not competitive with the first three methods, particularly when high-precision results are required. In a conference paper presented at RNC5 on Real Numbers and Computers (Sept 2003), when comparing Tanh-Sinh quadrature with Gaussian quadrature and Error Function quadrature, Bailey and Li found: "Overall, the Tanh-Sinh scheme appears to be the best. It combines uniformly excellent accuracy with fast run times. It is the nearest we have to a truly all-purpose quadrature scheme at the present time."

Upon comparing the scheme to Gaussian quadrature and Error Function quadrature, Bailey et al. (2005) found that the Tanh-Sinh scheme "appears to be the best for integrands of the type most often encountered in experimental math research".

Bailey (2006) found that: "The Tanh-Sinh quadrature scheme is the fastest currently known high-precision quadrature scheme, particularly when one counts the time for computing abscissas and weights. It has been successfully employed for quadrature calculations of up to 20,000-digit precision."

In summary, the Tanh-Sinh quadrature scheme is designed so that it gives the most accurate result for the minimum number of function evaluations. In practice, the Tanh-Sinh quadrature rule is almost invariably the best rule and is often the only effective rule when extended precision results are sought[citation needed].


  • Tanh-sinh, exp-sinh, and sinh-sinh quadrature are implemented in the C++ library Boost[3]
  • Tanh-sinh quadrature is implemented in a macro-enabled Excel spreadsheet by Graeme Dennes.[4]
  • Tanh-sinh quadrature is implemented in the Haskell package integration.[5]
  • Tanh-sinh quadrature is implemented in the Python library mpmath.[6]
  • An effective implementation of Tanh-sinh quadrature in C# by Ned Ganchovski.[7]


  1. ^ Takahashi & Mori (1974)
  2. ^ Mori (2005)
  3. ^ Thompson, Nick; Maddock, John. "Double-exponential quadrature". boost.org.
  4. ^ Dennes, Graeme. "Numerical Integration With Tanh-Sinh Quadrature". Newton Excel Bach, not (just) an Excel Blog.
  5. ^ Kmett, Edward. "integration: Fast robust numeric integration via tanh-sinh quadrature". Hackage.
  6. ^ "mpmath library for real and complex floating-point arithmetic with arbitrary precision". mpmath.
  7. ^ Ganchovski, Ned. "Tanh-Sinh Integration with C#". GitHub repository.


External links[edit]