{"paper_id":"2404.19290","title":"Efficient inverse $Z$-transform and Wiener-Hopf factorization","authors":["Svetlana Boyarchenko","Sergei Levendorskiĭ"],"paper_date":"2024-04-30","paper_type":"theoretical","paper_url":"https://arxiv.org/pdf/2404.19290v2","page_url":"https://thequant.space/flowcharts/efficient-inverse-z-transform-and-wiener-hopf-factorizatio/","scores":{"empirical_rigor":3,"math_complexity":8,"quadrant":"Lab Rats"},"proposes":{"status":"available","statement":"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.","quote":"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.","summary":"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…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"The function ˜u(z) is analytic in the interior of the unit circle, which is the maximal disc of analyticity.","type":"model","stated":"explicit","quote":"Assume that ˜u is analytic in the interior of T, and the interior is the maximal disc of analyticity.","support":"full"},{"assumption":"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.","type":"statistical","stated":"explicit","quote":"In the new variables, the integrands are analytic in strips around the real axis, hence, the simplified trapezoid rule is efficient.","support":"full"},{"assumption":"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.","type":"other","stated":"explicit","quote":"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.","support":"full"},{"assumption":"If the distribution has atoms, sinh‑acceleration is not applicable and a different family of conformal maps must be used.","type":"model","stated":"explicit","quote":"If the distribution has atoms, then the sinh-acceleration is not applicable but a different family of conformal maps can be used. In Sect.","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":"The Matlab implementation on a moderate Mac achieves a precision of 10⁻¹⁴ in several dozen microseconds and 10⁻¹¹ in several milliseconds.","kind":"performance","quote":"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.","support":"partial"},{"finding":"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.","kind":"performance","quote":"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.","support":"partial"},{"finding":"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.","kind":"performance","quote":"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.","support":"full"},{"finding":"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.","kind":"performance","quote":"The method of this section with N = 575 and N1 = 626, achieves the relative accuracy 4.08E-10 in 26.4 msec. 6.","support":"full"}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":11,"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-14T19:57:33Z"},"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/"}