Paper: arXiv 2404.19290

Authors: Svetlana Boyarchenko, Sergei Levendorskiĭ

Abstract

We suggest new closely related methods for numerical inversion of \(Z\)-transform and Wiener-Hopf factorization of functions on the unit circle, based on sinh-deformations of the contours of integration, corresponding changes of variables and the simplified trapezoid rule. As applications, we consider evaluation of high moments of probability distributions and construction of causal filters. Programs in Matlab running on a Mac with moderate characteristics achieves the precision E-14 in several dozen of microseconds and E-11 in several milliseconds, respectively.

Complexity vs Empirical Score

  • Math Complexity: 8.0/10
  • Empirical Rigor: 3.0/10
  • Quadrant: Lab Rats — high math complexity, limited empirical testing

Why this score: The paper presents advanced mathematical techniques (sinh-acceleration, contour deformations, Wiener-Hopf factorization) with complex derivations and error bounds, but lacks backtesting, financial data analysis, or implementation-focused empirical results.

Research Flowchart

  flowchart TD
  A["Research Goal<br>Efficient numerical inversion<br>of Z-transform & Wiener-Hopf factorization"] --> B["Methodology<br>Sinh-contour deformation<br>& change of variables"]
  B --> C["Data/Input<br>Functions on the unit circle"]
  C --> D["Computational Process<br>Simplified trapezoid rule"]
  D --> E["Key Outcomes<br>1. Evaluation of high moments<br>2. Construction of causal filters<br>3. Precision: E-14 (μs) & E-11 (ms)"]

Evidence Card

What the authors claim, on what data, and who has checked it. Read from the paper's own text by a language model: every quote is verbatim, nothing was re-run. How to read this card

Proposes

The paper proposes new closely related methods for numerical inversion of the Z‑transform and Wiener‑Hopf factorization of functions on the unit circle, based on sinh‑deformations of integration contours, corresponding changes of variables and the simplified trapezoid rule.

Source sentence
We suggest new closely related methods for numerical inversion of $Z$-transform and Wiener-Hopf factorization of functions on the unit circle, based on sinh-deformations of the contours of integration, corresponding changes of variables and the simplified trapezoid rule.

Assumes 4

  • The function ˜u(z) is analytic in the interior of the unit circle, which is the maximal disc of analyticity. model
    Source sentence
    Assume that ˜u is analytic in the interior of T, and the interior is the maximal disc of analyticity.
  • The integrands become analytic in strips around the real axis after the sinh‑acceleration change of variables, enabling efficient use of the simplified trapezoid rule. statistical
    Source sentence
    In the new variables, the integrands are analytic in strips around the real axis, hence, the simplified trapezoid rule is efficient.
  • The Hardy norm of the transformed integrand can be kept bounded by choosing the scaling parameter ρ not too large, otherwise high‑precision arithmetic is required. other
    Source sentence
    However, if ρ is large, one has to multiply very small numbers by very large ones, and high precision arithmetic is necessary to avoid large rounding errors.
  • If the distribution has atoms, sinh‑acceleration is not applicable and a different family of conformal maps must be used. model
    Source sentence
    If the distribution has atoms, then the sinh-acceleration is not applicable but a different family of conformal maps can be used. In Sect.

Data

No dataset named in the text.

Costs

Not applicable The paper reports no trading or execution result.

Finds 4

  • The Matlab implementation on a moderate Mac achieves a precision of 10⁻¹⁴ in several dozen microseconds and 10⁻¹¹ in several milliseconds. performance figure from elsewhere in the paper
    Source sentence
    Programs in Matlab running on a Mac with moderate characteristics achieves the precision E-14 in several dozen of microseconds and E-11 in several milliseconds, respectively.
  • In Example 3.5, µ₁₀₀ is computed with accuracy better than 10⁻¹⁵ using the Z‑SINH‑II algorithm with Nℓ=55, taking 19 µsec on average over 100,000 runs. performance figure from elsewhere in the paper
    Source sentence
    In Example 3.5, µ100 is calculated with the accuracy better than E-15 using Z-SINH-II algorithm with Nℓ= 55, the CPU time is 19 microsec., the average over 100,000 runs.
  • The impulse response function h[n] for n∈[100,400] is evaluated with relative accuracy 4.55×10⁻¹⁵ in 13.4 msec using N=172 and N₁=237 terms. performance
    Source sentence
    The algorithm in this section with N = 172 and N1 = 237 achieves accuracy 4.55E-15; the CPU time for the evaluation of all h[n], n ∈[100, 400], is 13.4 msec., the average over 10,000 runs.
  • When the Wiener‑Hopf factorization is applied to a case with very narrow annulus of analyticity, the method achieves relative accuracy 4.08×10⁻¹⁰ in 26.4 msec, outperforming the plain trapezoid rule. performance
    Source sentence
    The method of this section with N = 575 and N1 = 626, achieves the relative accuracy 4.08E-10 in 26.4 msec. 6.

Checked by others

No other paper in the archive has been found to support or contradict these findings (compared with 11 related papers). Coverage is partial, so this is neither replication nor refutation.

Code

No repository by the authors found in the paper.

Extracted 2026-11-14 · same card as JSON · A language model chose these items: check the source sentence before relying on one.

Cited References (27)

  1. Spectral Analysis of Signals (2005) — link
  2. introduction to random signals and applied kalman filtering (1992)
  3. Multi‐precision Laplace transform inversion (2004) — link
  4. Parabolic and hyperbolic contours for computing the Bromwich integral (2007) — link
  5. A Unified Framework for Numerically Inverting Laplace Transforms (2006) — link
  6. Talbot quadratures and rational approximations (2006) — link
  7. The Exponentially Convergent Trapezoidal Rule (2014) — link
  8. Numerical Inversion of Laplace Transforms of Probability Distributions (1995) — link
and 19 more
  1. Numerical inversion of probability generating functions (1992) — link
  2. OPTION PRICING FOR TRUNCATED LÉVY PROCESSES (2000) — link
  3. Computing the Gamma Function Using Contour Integrals and Rational Approximations (2007) — link
  4. An Improved Convolution Algorithm for Discretely Sampled Asian Options (2009) — link
  5. The Fourier-series method for inverting transforms of probability distributions (1992) — link
  6. Numerical Computation of the Moments of a Probability Distribution from its Transform (1996) — link
  7. The Accurate Numerical Inversion of Laplace Transforms (1979) — link
  8. An exact analytical solution for discrete barrier options (2005) — link
  9. Efficient variations of the Fourier transform in applications to option pricing (2014) — link
  10. SINH-ACCELERATION: EFFICIENT EVALUATION OF PROBABILITY DISTRIBUTIONS, OPTION PRICING, AND MONTE CARLO SIMULATIONS (2019) — link
  11. Static and Semi-Static Hedging as Contrarian or Conformist Bets (2019) — link
  12. Conformal Accelerations Method and Efficient Evaluation of Stable Distributions (2020) — link
  13. Pitfalls of the Fourier Transform Method in Affine Models, and Remedies (2016) — link
  14. Counterexamples in Probability. (1990) — link
  15. Fourier analysis and applications: filtering, numerical computation, wavelets (1999) — link
  16. Numerical Methods Based on Sinc and Analytic Functions (1993) — link
  17. An Introduction to Probability Theory and Its Applications. (1967) — link
  18. Unified Moment-Based Modeling of Integrated Stochastic Processes (2023) — link
  19. EFFICIENT EVALUATION OF DOUBLE-BARRIER OPTIONS (2024) — link

0 of 27 cited works are in the corpus; resolved via arXiv source bundles, Semantic Scholar and OpenAlex. Corpus-wide: 2596 linked papers.