{"paper_id":"2305.10725","title":"Efficient inverse $Z$-transform: sufficient conditions","authors":["Svetlana Boyarchenko","Sergei Levendorskiĭ"],"paper_date":"2023-05-18","paper_type":"theoretical","paper_url":"https://arxiv.org/pdf/2305.10725v1","page_url":"https://thequant.space/flowcharts/efficient-inverse-z-transform-sufficient-conditions/","scores":{"empirical_rigor":2.5,"math_complexity":9.2,"quadrant":"Lab Rats"},"proposes":{"status":"available","statement":"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.","quote":"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.","summary":"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…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"Mild conditions are imposed that are satisfied for wide classes of non‑symmetric Stieltjes‑Lévy processes.","type":"model","stated":"explicit","quote":"We impose mild conditions which are satisfied for wide classes of non-symmetric Stieltjes-Lévy processes. We impose mild conditions which are satisﬁed for wide classes of non-symmetric Stieltjes-L´evy processes.","support":"full"},{"assumption":"The analysis assumes a large but not extremely large number of monitoring points n, with n ≫ E ≫ ln n and E ≫ M.","type":"other","stated":"explicit","quote":"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.","support":"full"}]},"datasets":{"status":"none_found","items":[],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"none"},"transaction_costs":{"status":"not_applicable","modeled":"n/a","headline_net_of_costs":null,"detail":null,"quote":null,"source":"front_matter","rule":"R3","candidates":{"front_matter":"n/a","evidence_card":"n/a","evidence_card_quoted":false},"meaning":"the paper reports no trading or execution result"},"results":{"status":"available","evaluation_type":"none","findings":[{"finding":"For large n the new scheme’s computational complexity is dozens of times smaller than that of the trapezoid rule.","kind":"theoretical","quote":"For large $n$, the complexity of the new scheme is dozens of times smaller than the complexity of the trapezoid rule.","support":"full"},{"finding":"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.","kind":"performance","quote":"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.","support":"partial"}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":10,"citations":{"cited_by_in_corpus":0,"by_independent_authors":0,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":0,"unclassified":0},"independent_papers":[],"scope":"Citations between papers in this corpus only; citations from outside it are not counted."}},"implementation":{"status":"available","public":false,"code_url":null,"note":"No repository presented by the authors as their own was found in the paper. Absence here is not proof that no code exists."},"replication":{"status":"none_found","card":null,"note":"No replication of this paper has been run by thequant.space yet."},"extraction":{"text_source":"fulltext","model":"openai/gpt-oss-120b","version":2,"extracted_at":"2026-11-14T20:02:40Z"},"provenance":{"claims":"Everything here is what the authors state in the paper. Nothing was re-run or reproduced by the platform.","quotes":"Assumptions, datasets, cost detail and findings were extracted by a language model. Every quote is verbatim paper text. Where an item has `support`, \"full\" means every figure in it appears in the quoted sentences and \"partial\" means a figure is stated elsewhere in the paper; items with a figure found nowhere in the paper were discarded.","datasets_known":"datasets.known lists well-known vendors and public datasets by a stable id, found by a dictionary over the full text where the sentence says the data is used; it is independent of the model and covers only names in the dictionary.","flags":"transaction_costs.modeled, results.evaluation_type and results.out_of_sample.method are platform classifications (structured-decision models); see https://thequant.space/score-guide/#penalty-flags","comparisons":"supports / contradicts / qualifies are a language model's reading of two papers' quoted findings, restricted to closely related papers that share no author. They are pointers to read, not verified replications, and coverage is partial.","implementation":"code_url is a repository the paper itself presents as its own (rule-scored, ambiguous cases judged by a model), checked for liveness when it was recorded."},"docs":"https://thequant.space/agents/"}