Paper: arXiv 2305.10725

Authors: Svetlana Boyarchenko, Sergei Levendorskiĭ

Abstract

We derive several sets of sufficient conditions for applicability of the new efficient numerical realization of the inverse \(Z\)-transform. For large \(n\), the complexity of the new scheme is dozens of times smaller than the complexity of the trapezoid rule. As applications, pricing of European options and single barrier options with discrete monitoring are considered; applications to more general options with barrier-lookback features are outlined. In the case of sectorial transition operators, hence, for symmetric Lévy models, the proof is straightforward. In the case of non-symmetric Lévy models, we construct a non-linear deformation of the dual space, which makes the transition operator sectorial, with an arbitrary small opening angle, and justify the new realization. We impose mild conditions which are satisfied for wide classes of non-symmetric Stieltjes-Lévy processes.

Complexity vs Empirical Score

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

Why this score: The paper presents advanced mathematical analysis involving complex analysis, operator theory, and deformation of spaces to derive sufficient conditions for an efficient inverse Z-transform, earning a high math score. However, it lacks backtest data, implementation code, or empirical performance metrics, focusing instead on theoretical validity and algorithmic complexity, resulting in a low empirical rigor score.

Research Flowchart

  flowchart TD
  Start(["Research Goal:<br>Efficient Inverse Z-Transform"]) --> Step1["Derive Sufficient Conditions<br>for New Numerical Scheme"]
  
  Step1 --> Condition{"Model Type?"}
  
  Condition -- "Symmetric Lévy<br>(Sectorial Operator)" --> Case1["Straightforward Proof"]
  Condition -- "Non-Symmetric Lévy" --> Case2["Construct Non-Linear<br>Dual Space Deformation"]
  
  Case1 --> Comp1["Apply Efficient Scheme<br>Complexity ~ dozens times<br>smaller than Trapezoid Rule"]
  Case2 --> Comp1
  
  Comp1 --> Data1["European Options"]
  Comp1 --> Data2["Discrete Barrier Options"]
  Comp1 --> Data3["Barrier-Lookback Features"]
  
  Data1 --> Outcome1["Key Findings:<br>1. Mild conditions ensure<br>application to Stieltjes-Lévy processes<br>2. Efficiency gain for large n"]
  Data2 --> Outcome1
  Data3 --> Outcome1

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 a new efficient numerical realization of the inverse Z‑transform that is dozens of times faster than the trapezoid rule for large n.

Source sentence
We derive several sets of sufficient conditions for applicability of the new efficient numerical realization of the inverse $Z$-transform. For large $n$, the complexity of the new scheme is dozens of times smaller than the complexity of the trapezoid rule.

Assumes 2

  • Mild conditions are imposed that are satisfied for wide classes of non‑symmetric Stieltjes‑Lévy processes. model
    Source sentence
    We impose mild conditions which are satisfied for wide classes of non-symmetric Stieltjes-Lévy processes. We impose mild conditions which are satisfied for wide classes of non-symmetric Stieltjes-L´evy processes.
  • The analysis assumes a large but not extremely large number of monitoring points n, with n ≫ E ≫ ln n and E ≫ M. other
    Source sentence
    Assume that 1) n is large but not extremely large so that n >> E >> ln n, and 2) E >> M. Then we may use the approximation (2.23) Nℓ≈(E + 2M) ln(n/M) kdπ2/4 . 2.4.

Data

No dataset named in the text.

Costs

Not applicable The paper reports no trading or execution result.

Finds 2

  • For large n the new scheme’s computational complexity is dozens of times smaller than that of the trapezoid rule. theoretical
    Source sentence
    For large $n$, the complexity of the new scheme is dozens of times smaller than the complexity of the trapezoid rule.
  • The speed‑up factor K of the new method over the trapezoid rule is approximately (n/M)/ln(n/M); e.g., for daily monitoring with T=5 years (n=1260) K≈14, for T=15 years K≈32, and for T=30 years K≈57. performance figure from elsewhere in the paper
    Source sentence
    Comparison of the complexity of the two schemes. Comparing (2.6) with (2.23), we see that the complexity of the trapezoid rule exceeds the complexity of the new numerical realization of the inverse Z-transform by the factor K ≈(n/M)/ ln(n/M). Example 2.5.

Checked by others

No other paper in the archive has been found to support or contradict these findings (compared with 10 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.