--- title: SINH-Acceleration Method Overview url: https://www.emergentmind.com/topics/sinh-acceleration-method type: topic --- # SINH-Acceleration Method Overview SINH-acceleration denotes a family of numerical acceleration techniques built around the hyperbolic sine function, used to improve the convergence of quadrature, Sinc discretizations, Fourier inversion, option-pricing transforms, and nonuniform sampling reconstructions. In one formulation, the method composes a canonical outer map with a polynomial adjustment to the \(\sinh\) map so that the preimages of nearby singularities are placed on the boundary of the maximal strip of analyticity, which yields asymptotically optimal double-exponential convergence for the trapezoidal rule and Sinc numerical methods. In another formulation, the integration contour is deformed by \(\xi=i\omega_1+b\sinh(i\omega+y)\) into a cone where the characteristic exponent damps the integrand, so that the simplified trapezoidal rule converges exponentially with explicit error control. A third formulation uses a compactly supported sinh-type window to regularize Lagrangian nonuniform sampling series, producing sharper exponential error decay than Gaussian regularization in the setting analyzed in the literature [1406.3320] [1808.05295] [2109.08738] [2601.17685]. ## 1. Analytic structure and the role of the sinh map The common analytic mechanism is the conversion of an oscillatory, slowly decaying, or singularity-limited problem into one whose transformed integrand is analytic in a strip and decays rapidly along the real line. In the quadrature and Sinc setting, the relevant domain is the strip \[ \mathscr{D}_d=\{z\in\mathbb{C}:|\operatorname{Im}z|0. \] Because \(\sinh t\) grows like \(\tfrac12 e^{|t|}\), the composition \(\psi\circ h\) induces double-exponential decay near endpoints or boundaries in the target domain. In the Fourier-inversion literature, the corresponding contour deformation is \[ \xi=\chi_{\omega_1,\theta;b}(y)=i\omega_1+b\sinh(i\theta+y),\qquad y\in\mathbb{R}, \] with Jacobian \(d\xi/dy=b\cosh(i\theta+y)\). There the deformation is selected so that the contour remains inside a union of strips and open cones where the characteristic exponent is analytic and damping is strong [1808.05295] [2109.08738]. This suggests a unifying perspective: the term “SINH-acceleration” is not restricted to a single algorithm, but denotes a class of sinh-based conformal or regularizing devices whose purpose is to enlarge the effective analyticity domain seen by the numerical scheme and to convert weak decay into rapid decay. ## 2. Polynomial-adjusted sinh maps for trapezoidal and Sinc convergence In the conformal-map formulation, the central problem is the treatment of finitely many singularities near the contour of integration. If the original integrand has singularities at \(\{\delta_k\pm i\epsilon_k\}_{k=1}^n\) in the \(x\)-plane, these are pulled back through the outer map: \[ \tilde{\delta}_k\pm i\tilde{\epsilon}_k=\psi^{-1}(\delta_k\pm i\epsilon_k). \] The parameters in \(h\) are then chosen so that the preimages lie on the boundary of the maximal strip \(\mathscr{D}_{\pi/2}\): \[ h(x_k+i\pi/2)=\tilde{\delta}_k+i\tilde{\epsilon}_k,\qquad k=1,\ldots,n, \] with unknown real abscissae \(x_k\). This places all singularity preimages on \(\partial\mathscr{D}_{\pi/2}\), preserving analyticity in the interior and restoring the maximal feasible strip width \(d=\pi/2\) [1406.3320]. The parameter selection is posed as a nonlinear program. The constraints above provide \(n\) complex conditions for the unknowns \(\{u_0,\ldots,u_n\}\) and \(\{x_k\}\), leaving one degree of freedom. The construction maximizes \(u_0\), because \(u_0\) is directly proportional to the double-exponential decay constant \(\beta_2\); larger \(u_0\) yields faster endpoint decay and smaller errors. The optimization problem is \[ \begin{array}{ll} \text{maximize } u_0, \\ \text{subject to } h(x_k+i\pi/2)=\tilde{\delta}_k+i\tilde{\epsilon}_k,\quad k=1,\ldots,n, \end{array} \] together with a stabilizing ad hoc constraint such as \(x_1=0\) for \(n=1\) or \(|x_1+x_n|\le \bar{x}\) for \(n\ge 2\), with \(\bar{x}=20\) in the reported experiments [1406.3320]. The theoretical basis is the strip-width constraint \[ d\gamma\le \frac{\pi}{2}, \] identified as necessary by a nonexistence theorem. The asymptotically optimal regime is therefore \[ d\gamma=\frac{\pi}{2}. \] For the trapezoidal rule under double-exponential decay, \[ \mathscr{E}_{N,h}^{\rm T}(H^\infty(\mathscr{D}_d,\omega)) \le C_{d,\omega}\exp\!\left(-\frac{\pi d\gamma N}{\log(\pi d\gamma N/\beta_2)}\right), \qquad h=\frac{\log(2\pi d\gamma n/\beta_2)}{\gamma n}. \] When \(d\gamma=\pi/2\), the asymptotic rate becomes \[ \mathscr{E}_{N,h}^{\rm T} \le C_{d,\omega}\exp\!\left(-\frac{\pi^2 N}{2\log(\pi^2N/(2\beta_2))}\right). \] The corresponding Sinc approximation satisfies \[ \mathscr{E}_{N,h}^{\rm Sinc}(H^\infty(\mathscr{D}_d,\omega)) \le C_{d,\omega}\exp\!\left(-\frac{\pi d\gamma N}{2\,\log(\pi d\gamma N/(2\beta_2))}\right), \qquad h=\frac{\log(\pi d\gamma n/\beta_2)}{\gamma n}, \] and under \(d\gamma=\pi/2\), \[ \mathscr{E}_{N,h}^{\rm Sinc} \le C_{d,\omega}\exp\!\left(-\frac{\pi^2N}{4\log(\pi^2N/(4\beta_2))}\right). \] Within this framework, the polynomial-adjusted sinh map achieves the maximal admissible strip and improves the secondary constants via \(u_0\), which explains the observed acceleration relative to classical sinh or unadapted double-exponential maps [1406.3320]. ## 3. Adaptive singularity recovery and algorithmic realization When singularity locations are unknown, the conformal-map approach is combined with Sinc-Padé approximation. For Sinc points \(x_k=kh\) and samples \(f(x_k)\), the approximant \[ \{r/s\}_f(x)=\frac{\sum_{i=0}^{r}p_i x^i}{1+\sum_{j=1}^{s}q_j x^j} \] is defined by solving \[ \sum_{i=0}^{r}p_i x_k^i-f(x_k)\sum_{j=1}^{s}q_j x_k^j=f(x_k), \] using central Sinc samples. The poles of \(\{r/s\}_f\) are then treated as approximate singularity locations and are inserted into the same nonlinear program used in the known-singularity case [1406.3320]. Because Sinc sampling is double-exponentially distributed, the associated linear system becomes ill-conditioned if too many far-out samples are used. The reported practical restrictions are therefore to use samples near the center only and to take \(r,s=O(\log n)\), with the paper giving \(r=\log_2 n-2\) and \(s=\log_2 n+2\) as representative choices. The adaptive procedure begins with a naive DE approximation, doubles \(n\) until the relative error is below \(10^{-3}\), then iterates pole estimation, nonlinear-map optimization, and geometric refinement until the target tolerance \(\varepsilon\) is reached. The paper states that this adaptive method has “almost the same convergence properties” as the non-adaptive method with known singularities [1406.3320]. The end-to-end implementation in the quadrature/Sinc setting proceeds as follows. One first identifies the canonical domain and selects the outer map \(\psi\). If singularities are known, they are pulled back by \(\psi^{-1}\) and the nonlinear program for \(h\) is solved; an optional homotopy from an easy initial configuration may be used to generate initial guesses. If singularities are unknown, the adaptive Sinc-Padé stage supplies approximate pole data. The transformed mesh is then set with the optimal DE step, the mapped integrand \(f(\phi(t))\phi'(t)\) is evaluated, and \(n\) is increased geometrically until the desired tolerance is achieved. Each quadrature step uses \(N=2n+1\) function evaluations, the nonlinear program has \(O(n)\) variables and constraints and is reported as efficiently solvable with modern solvers such as Ipopt, and \(\phi^{-1}\) for mapped Sinc can be obtained by Newton iteration [1406.3320]. A recurrent comparison in this literature is with exact Schwarz–Christoffel strip maps. The polynomial-adjusted sinh map is approximate rather than exact, but it is much cheaper to evaluate because it uses elementary functions rather than strip-map integrals, while still preserving the decisive strip-width property. ## 4. Fourier inversion, contour deformation, and option-pricing transforms In Fourier-based probability and pricing, SINH-acceleration is a contour-deformation technique for integrals of the form \[ I=\frac{1}{2\pi}\int_{\xi=\omega_0} e^{i x'\xi-\psi^0(\xi)}F(\xi)\,d\xi, \] or, more generally, for Lévy, Heston, CIR, and subordinated models with characteristic exponent \(\psi(\xi)=-i\mu\xi+\psi^0(\xi)\). The core map is \[ \xi=\chi_{\omega_1,\theta;b}(y)=i\omega_1+b\sinh(i\theta+y), \] chosen so that the deformed contour remains in the analyticity domain of \(\psi^0\) and \(F\), while the sign of \(x'\) determines whether the contour is tilted upward or downward to turn the oscillatory factor into exponential decay. The transformed integrand is analytic in a strip \(S_{(-d,d)}\) and is evaluated by the simplified trapezoidal rule, with discretization error bounded by Stenger’s estimate \[ \mathrm{Err}_{\mathrm{disc}} \le H(f;d)\,\frac{e^{-2\pi d/h}}{1-e^{-2\pi d/h}}, \qquad h=\frac{2\pi d}{\ln(H(f;d)/\varepsilon)} \] in the practical parameter selection scheme reported in the option-pricing literature [1808.05295] [2109.08738]. A central advantage over FFT-based schemes is the decoupling of discretization, truncation, and aliasing errors. In the B-spline projection method (PROJ), the coefficients \[ \beta_{a,k}=\frac{a^{-1/2}}{2\pi}\int_{\xi=\omega} e^{-i x_k \xi-\psi(\xi)\bar\Delta}\, \widehat{\widetilde{\varphi}}\!\left(\frac{\xi}{a}\right)\,d\xi \] are computed pointwise on the deformed contour. For linear B-splines, the dual filter \[ \widehat{\widetilde{\varphi}}(\xi)=\frac{12\sin^2(\xi/2)}{\xi^2(2+\cos\xi)} \] has pole families at \[ \xi_\ell^\pm=(2\ell+1)\pi\pm i\ln(2+\sqrt{3}), \] and the contour may be shifted deliberately across these poles when beneficial, with residues computed explicitly and reused across grid points through residue series \(J^\pm\). The deformed-contour strategy removes the periodic wrap-around intrinsic to FFT truncation and thereby eliminates aliasing on narrow supports or asymmetric tails [2109.08738]. The 2018 treatment develops the same contour principle for PDFs, CDFs, European options, Heston pricing, CIR bond options, CIR-subordinated Lévy models, calibration, and quantile computation via “conformal principal components.” The reusable nodes \[ \xi_j=i\omega_1+b\sinh(i\omega+y_j),\qquad y_j=jh, \] allow repeated evaluation of \(F\), \(F'\), and \(F''\) with \(x\)-dependence entering only through \(e^{-ix'\xi_j}\), which is then used in Newton or bisection schemes for tail quantiles [1808.05295]. The reported performance is strongly application-dependent but consistently favorable in the regimes studied. For NTS PDFs at the peak, SINH achieves \(\varepsilon\approx 10^{-15}\) with \(N\approx 30\)–\(35\) in about \(7\,\mu\text{s}\) average time; for Heston puts, \(N\approx 50\)–\(90\) yields \(\varepsilon\approx 10^{-12}\) in roughly \(45\)–\(70\,\mu\text{s}\); and for CIR bond options the node counts are much smaller than those required by fractional-parabolic deformation or flat inverse Fourier transforms. In the PROJ setting, SINH is reported as robust and accurate for European and barrier options, and it remains effective when FFT coefficients are degraded by aliasing, underspecified truncation widths, or narrow double-barrier intervals [1808.05295] [2109.08738]. ## 5. Sinh regularization in Lagrangian nonuniform sampling A distinct, though related, use of the term appears in nonuniform sampling theory. Here the problem is reconstruction of \(f\in\mathcal{B}_\delta(\mathbb{R})\), where \[ \mathcal{B}_\delta(\mathbb{R})=\{f\in C(\mathbb{R})\cap L^2(\mathbb{R}):\operatorname{supp}\hat f\subseteq[-\delta,\delta]\}, \qquad \delta\in(0,\pi), \] from nonuniform samples associated with a sine-type function \(F\) whose real zeros form a separated set \(\Gamma=\{\lambda_j\}_{j\in\mathbb Z}\). The classical Lagrangian sampling expansion is \[ f(x)=\sum_{j\in\mathbb Z} f(\lambda_j)\frac{F(x)}{F'(\lambda_j)(x-\lambda_j)}. \] The sinh-regularized method multiplies the finite Lagrangian series by a compactly supported window \[ \varphi_{\beta,m}(x)= \begin{cases} \dfrac{1}{\sinh\beta}\,\sinh\!\left(\beta\sqrt{1-\dfrac{x^2}{m^2}}\right), & |x|\le m,\\[1ex] 0, & |x|>m, \end{cases} \] with \(\varphi_{\beta,m}(0)=1\), so that distant samples are suppressed without attenuating the central contribution [2601.17685]. For a finite sample set \(\Lambda=\{\lambda_j\}_{j=-N}^N\), the auxiliary sine-type function \[ F_\Lambda(z)=\sin(\pi z)\prod_{j=-N}^{N}\frac{z-\lambda_j}{z-j} \] yields basis functions \[ Q_{\Lambda,j}(z)=\frac{R_j(z)\,\operatorname{sinc}(z-j)}{R_j(\bar\lambda_j)\,\operatorname{sinc}(\bar\lambda_j-j)}, \] and the regularized series is \[ S_{f,Q,N,\varphi}(x)=\sum_{j=-N}^{N} f(\lambda_j)\,Q_{\Lambda,j}(x)\,\varphi_{\beta,N-1}(x-\lambda_j), \qquad \beta=(N-1)(\pi-\delta),\quad m=N-1. \] In the periodic \(M\)-channel setting, one uses \[ S_{f,\psi,N,\varphi}(x)=\sum_{n=-N}^{N}\sum_{m=1}^{M}f(\tau_{mn})\,\psi_{mn}(x)\, \varphi_{\beta M,(N-1)M}(x-\tau_{mn}), \qquad \tau_{mn}=t_m+Mn. \] The Fourier transform of the window has a Bessel representation, and the tail estimate \[ \int_{|\omega|\ge \pi-\delta}\left|\widehat{\varphi}_{\beta,N-1}(\omega)\right|\,d\omega \lesssim \frac{\beta}{\sinh\beta}\asymp \beta e^{-\beta} \] drives the main error bounds [2601.17685]. The resulting non-periodic and periodic estimates are \[ \sup_{x\in[-1,1]}\left|f(x)-S_{f,Q,N,\varphi}(x)\right| \lesssim C_\Lambda\,\beta\,e^{-(N-1)(\pi-\delta)}\,\|f\|_{L^2(\mathbb{R})}, \] and \[ \sup_{x\in[-1,1]}\left|f(x)-S_{f,\psi,N,\varphi}(x)\right| \lesssim C_{F_{\mathrm{per}}}\,M\,\beta\,e^{-(N-1)M(\pi-\delta)}\,\|f\|_{L^2(\mathbb{R})}. \] The comparison paper states that Gaussian regularization yields an exponential term of order \[ \mathcal{O}\!\left(e^{-\,\frac{N}{2}(\pi-\delta)}\right), \] so the sinh window nearly doubles the decay rate in the exponent at the level of the main asymptotic dependence on \(N\). The analysis also relaxes the admissible perturbation condition for the finite-\(\Lambda\) construction to \(L:=\sup_{|j|\le N}|\lambda_j-j|<1\), whereas the Gaussian comparison cited in that work required \(L<1/2\) [2601.17685]. ## 6. Applications, empirical behavior, and limitations The conformal-map version of SINH-acceleration was demonstrated on endpoint-singular and complex-singular integrals, Goursat’s infinite integral, adaptive singularity recovery, nonlinear waves, and multidimensional expectations. In the interval example with logarithmic endpoint singularities at \(x=\pm1\) and nearby complex conjugate singularities at \(-\tfrac12\pm i\) and \(\tfrac12\pm i/2\), the optimized map \[ h(t)\approx 0.13912\,\sinh t+0.19081+0.21938\,t \] produced markedly faster convergence than the standard DE map, with roughly \(2.5\)–\(4\times\) more correct digits for the same \(N\). For Goursat’s integral on \([0,\infty)\), prior DE achieved about \(10^{-72}\) relative error with about \(480\) function evaluations, whereas the optimized DE map achieved the same error with about \(140\) evaluations. In multidimensional expectations over \([0,1]^m\), optimized DE gave significantly lower errors than standard DE for \(m=2\)–\(4\), although the total cost remained \(O(N^m)\) [1406.3320]. In option pricing, the most emphasized practical gain is robustness under heavy tails, asymmetry, narrow supports, and path dependence. For CGMY/KoBoL densities, FFT truncation on a narrow support produces periodic wrap-around, whereas SINH computes coefficients on deformed contours without periodicity and therefore does not alias. For European options under CGMY with \(S_0=W=100\) and \(T=1\), the paper reports that, when the truncation width is underspecified with \(L_1=4\), SINH attains beyond practical precision of approximately \(10^{-7}\)–\(10^{-8}\) with moderate \(N_y\), while FFT stagnates around \(10^{-5}\)–\(10^{-6}\). For an up-and-out call with \(K=S_0=100\), \(U=120\), \(M=12\), \(T=1\), SINH reaches approximately \(10^{-7}\)–\(10^{-8}\) accuracy for \(L_1=4\), whereas FFT stalls near \(3\times10^{-5}\). In a double barrier call with \([L,U]=[80,120]\), naive FFT saturates around \(10^{-3}\)–\(10^{-2}\), while SINH converges with empirically fourth-order behavior, and an anti-aliasing FFT requires six times more coefficients during initialization to achieve comparable rates [2109.08738]. The nonuniform-sampling formulation shows a different empirical profile. For the test function used in the 2026 study, averaged over \(100\) realizations, the non-periodic case with \(\delta=\pi/2\) and \(N=9\) yielded Gaussian error about \(1.92\times 10^{-2}\) and sinh error about \(2.58\times 10^{-5}\); for \(\delta=2\pi/3\) and \(N=18\), the errors were about \(3.61\times 10^{-4}\) and \(3.22\times 10^{-8}\); and for \(\delta=5\pi/6\) and \(N=21\), about \(2.30\times 10^{-4}\) and \(6.42\times 10^{-7}\). The observed curves were reported to match the predicted main exponential terms \(\exp(-(N-1)(\pi-\delta))\) and \(\exp(-(N-1)M(\pi-\delta))\) [2601.17685]. Several limitations recur across the literature. In the conformal-map quadrature setting, the map is approximate, so while it enforces \(d=\pi/2\), the constant \(\beta_2\) need not be fully optimal; however, the cited theorem shows that \(\beta_2\) enters only logarithmically in the asymptotic bound. Rational Sinc-Padé approximants are less effective at locating branch points and essential singularities than simple poles, which constrains adaptivity. Infinite arrays of singularities can limit the attainable rate to roughly single-exponential under further compositions. In high dimensions, the optimized maps improve constants but do not remove the curse of dimensionality. In the Fourier-pricing formulation, narrow analyticity cones restrict the allowable tilt and reduce the strip width \(d\), increasing the number of trapezoid points; branch cuts and pole geometry must still be respected carefully. In the sampling formulation, when \(\delta\) is very close to \(\pi\), the oversampling gap is small and larger \(N\) is required because the decay exponent scales with \(\pi-\delta\) [1406.3320] [1808.05295] [2601.17685]. A common misconception is to identify SINH-acceleration with a single fixed map such as \(\psi(\tfrac{\pi}{2}\sinh t)\) or with tanh-sinh quadrature in the narrow sense. The cited literature instead uses the term for a broader analytic strategy: either a polynomially adjusted sinh conformal map that repositions singularity preimages, a sinh contour deformation that exploits strip-and-cone analyticity of characteristic exponents, or a compactly supported sinh window that regularizes truncation in nonuniform sampling. What these constructions share is the use of the sinh function as the mechanism by which analyticity and decay are reshaped into forms that the trapezoidal rule, Sinc approximations, or Lagrangian series can exploit at near-optimal rates [1406.3320] [1808.05295] [2109.08738] [2601.17685]. Source: https://www.emergentmind.com/topics/sinh-acceleration-method