pith. sign in

arxiv: 1907.02758 · v1 · pith:YYKS4L6Cnew · submitted 2019-07-05 · 🧮 math.NA · cs.NA

Exploration of a Cosine Expansion Lattice Scheme

Ki Wai Chau , Cornelis W. Oosterlee This is my paper

Pith reviewed 2026-05-25 02:10 UTC · model grok-4.3

classification 🧮 math.NA cs.NA
keywords quasi-Monte CarloFourier-cosineexpectation computationlattice sequencesnumerical approximationerror analysiswavelets
0
0 comments X

The pith

A lattice sequence from quasi-Monte Carlo combined with the Fourier-cosine method creates a scheme for approximating expectations.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper develops an approximation scheme by merging lattice sequences used in quasi-Monte Carlo methods with the Fourier-cosine expansion technique. The goal is to compute expectations more efficiently. The authors examine the error behavior of this new scheme and perform comparisons with their prior wavelet-based approach. Numerical experiments are used to illustrate the method's behavior.

Core claim

The authors design an approximation scheme for expectation computation by combining a lattice sequence from Quasi-Monte Carlo rules with the philosophy of the Fourier-cosine method. They study the error of this scheme and compare it with previous work on wavelets, supported by numerical experiments.

What carries the argument

The lattice-cosine scheme that integrates quasi-Monte Carlo lattice sequences with cosine expansions for expectation approximation.

If this is right

  • The error of the lattice-cosine scheme admits analysis.
  • The scheme can be compared directly to wavelet methods.
  • Numerical experiments reveal performance characteristics of the approach.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • This method could be applied to problems in financial mathematics where expectation values are central.
  • Further work might explore convergence rates for specific function classes.
  • Extensions to higher dimensions may show advantages over traditional methods.

Load-bearing premise

The combined scheme admits a meaningful error analysis and demonstrates practical advantages over wavelets through numerical experiments.

What would settle it

Numerical tests on standard test functions showing that the error does not decrease or that the scheme underperforms the wavelet method in the tested cases.

Figures

Figures reproduced from arXiv: 1907.02758 by Cornelis W. Oosterlee, Ki Wai Chau.

Figure 1
Figure 1. Figure 1: Absolute error verses the number of lattice points [PITH_FULL_IMAGE:figures/full_fig_p019_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Absolute error verses the number of lattice points [PITH_FULL_IMAGE:figures/full_fig_p020_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Absolute error verses the number of lattice points [PITH_FULL_IMAGE:figures/full_fig_p021_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Absolute error verses the number of lattice points [PITH_FULL_IMAGE:figures/full_fig_p022_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Absolute error verses the number of lattice points [PITH_FULL_IMAGE:figures/full_fig_p023_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: The quadrature points distribution for COS wavele [PITH_FULL_IMAGE:figures/full_fig_p024_6.png] view at source ↗
read the original abstract

In this article, we combine a lattice sequence from Quasi-Monte Carlo rules with the philosophy of the Fourier-cosine method to design an approximation scheme for expectation computation. We study the error of this scheme and compare this scheme with our previous work on wavelets. Also, some numerical experiments are performed.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 0 minor

Summary. The manuscript proposes combining a lattice sequence from Quasi-Monte Carlo rules with the Fourier-cosine method to create an approximation scheme for expectation computation. It states that the error of the scheme is studied, the scheme is compared to the authors' prior wavelet work, and numerical experiments are performed.

Significance. A rigorously analyzed lattice-cosine scheme with explicit error rates and demonstrated advantages over wavelets could contribute to numerical methods for high-dimensional integration and expectation computation. However, the abstract provides no function classes, dimensions, error metrics, or bounds, so the significance cannot be assessed from the given information.

major comments (1)
  1. [Abstract] Abstract: the claim that 'the error is studied' and that the scheme admits 'meaningful error analysis' with practical advantages over wavelets cannot be evaluated, as no function class (e.g., C^k, Sobolev), dimension range, error metric, lattice rank, or explicit rates are named.

Simulated Author's Rebuttal

1 responses · 0 unresolved

Thank you for the opportunity to respond to the referee's report. We address the major comment below.

read point-by-point responses

  1. Referee: [Abstract] Abstract: the claim that 'the error is studied' and that the scheme admits 'meaningful error analysis' with practical advantages over wavelets cannot be evaluated, as no function class (e.g., C^k, Sobolev), dimension range, error metric, lattice rank, or explicit rates are named.

    Authors: We agree that the abstract is concise and omits these specifics, which are instead detailed in the body of the manuscript (error analysis for functions of bounded variation or in appropriate Sobolev spaces, moderate dimensions, L^2-type error metrics, rank-1 lattices, and explicit rates combining cosine truncation and lattice discrepancy bounds). To make the abstract self-contained and allow evaluation of the claims, we will revise it to briefly name the function class, dimension range, error metric, and convergence rates. revision: yes

Circularity Check

0 steps flagged

No circularity: scheme construction and error study are independent of inputs

full rationale

The paper proposes a new approximation scheme by combining an existing lattice sequence (from QMC) with the Fourier-cosine expansion philosophy, then states that the error is studied and the scheme is compared to the authors' prior wavelet work via numerical experiments. No equations or steps in the provided abstract or description reduce a claimed prediction or uniqueness result to a fitted parameter, self-citation chain, or definitional tautology. The derivation chain is self-contained as a constructive combination whose properties are asserted to be verifiable externally through analysis and tests, without any load-bearing step that collapses by construction.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Only the abstract is available; no specific free parameters, axioms, or invented entities are described in sufficient detail to populate the ledger.

pith-pipeline@v0.9.0 · 5560 in / 1197 out tokens · 40209 ms · 2026-05-25T02:10:21.802013+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

24 extracted references

  1. [1]

    Aronszajn

    N. Aronszajn. Theory of reproducing kernels. Transactions of the American Mathematical Society, 68(3):337–404, 1950. 24

    1950

  2. [2]

    Borovykh, A

    A. Borovykh, A. Pascucci, and C. W. Oosterlee. Efficient co mputation of various valuation adjustments under local L´ evy models.SIAM Journal on Financial Mathematics , 9(1):251–273, 2018

    2018

  3. [3]

    K. W. Chau and C. W. Oosterlee. On the wavelet-based SWIFT method for backward stochas- tic differential equations. IMA Journal of Numerical Analysis , 38(2):1051–1083, 04 2018

    2018

  4. [4]

    K. W. Chau, S. C. P. Yam, and H. Yang. Fourier-cosine metho d for ruin probabilities. Journal of Computational and Applied Mathematics , 281:94 – 106, 2015

    2015

  5. [5]

    Cools, F

    R. Cools, F. Y. Kuo, and D. Nuyens. Constructing embedded lattice rules for multivariate integration. SIAM Journal on Scientific Computing , 28(6):2162–2188, 2006

    2006

  6. [6]

    J. Dick. On the convergence rate of the component-by-com ponent construction of good lattice rules. Journal of Complexity , 20(4):493 – 522, 2004

    2004

  7. [7]

    J. Dick, D. Nuyens, and F. Pillichshammer. Lattice rules for nonperiodic smooth integrands. Numerische Mathematik , 126(2):259–291, Feb 2014

    2014

  8. [8]

    Dick and F

    J. Dick and F. Pillichshammer. Digital Nets and Sequences: Discrepancy Theory and Quasi–Monte Carlo Integration . Cambridge University Press, 2010

    2010

  9. [9]

    J. Dick, F. Pillichshammer, and B. J. Waterhouse. The con struction of good extensible rank-1 lattices. Mathematics of Computation , 77(264):2345–2373, 2008

    2008

  10. [10]

    Fang and C

    F. Fang and C. W. Oosterlee. A novel pricing method for Eu ropean options based on Fourier- cosine series expansions. SIAM Journal on Scientific Computing , 31(2):826–848, 2009

    2009

  11. [11]

    Fang and C

    F. Fang and C. W. Oosterlee. Pricing early-exercise and discrete barrier options by Fourier- cosine series expansions. Numerische Mathematik , 114(1):27–62, Aug 2009

    2009

  12. [12]

    Fischer and J

    B. Fischer and J. Prestin. Wavelets based on orthogonal polynomials. Mathematics of Com- putation, 66(220):1593–1618, 1997

    1997

  13. [13]

    F. J. Hickernell, P. Kritzer, F. Y. Kuo, and D. Nuyens. We ighted compound integration rules with higher order convergence for all N. Numerical Algorithms, 59(2):161–183, Feb 2012

    2012

  14. [14]

    F. J. Hickernell and H. Niederreiter. The existence of g ood extensible rank-1 lattices. Journal of Complexity , 19(3):286 – 300, 2003. Oberwolfach Special Issue

    2003

  15. [15]

    T. J. Kozubowski, K. Podg´ orski, and I. Rychlik. Multiv ariate generalized Laplace distribution and related random fields. Journal of Multivariate Analysis , 113:59 – 72, 2013. Special Issue on Multivariate Distribution Theory in Memory of Samuel Kot z

    2013

  16. [16]

    F. Y. Kuo and S. Joe. Component-by-component construct ion of good lattice rules with a composite number of points. Journal of Complexity , 18(4):943 – 976, 2002

    2002

  17. [17]

    M. Lisi. Some remarks on the Cantor pairing function. Le Matematiche , 62(1):55–65, Dec 2007

    2007

  18. [18]

    Niederreiter

    H. Niederreiter. Random Number Generation and Quasi-Monte Carlo Methods . Society for Industrial and Applied Mathematics, 1992. 25

    1992

  19. [19]

    Nuyens and R

    D. Nuyens and R. Cools. Fast algorithms for component-b y-component construction of rank-1 lattice rules in shift-invariant reproducing kernel Hilbe rt spaces. Mathematics of Computation , 75(254):903–920, 2006

    2006

  20. [20]

    Nuyens and R

    D. Nuyens and R. Cools. Fast component-by-component co nstruction of rank-1 lattice rules with a non-prime number of points. Journal of Complexity , 22(1):4 – 28, 2006. Special Issue

    2006

  21. [21]

    Ruijter and C

    M. Ruijter and C. W. Oosterlee. Two-dimensional fourie r cosine series expansion method for pricing financial options. SIAM Journal on Scientific Computing , 34(5):B642–B671, 2012

    2012

  22. [22]

    Ruijter and C

    M. Ruijter and C. W. Oosterlee. A Fourier cosine method f or an efficient computation of solutions to BSDEs. SIAM Journal on Scientific Computing , 37(2):A859–A889, 2015

    2015

  23. [23]

    I. H. Sloan, F. Y. Kuo, and S. Joe. On the step-by-step con struction of quasi-monte carlo integration rules that achieve strong tractability error b ounds in weighted Sobolev spaces. Mathematics of Computation , 71(240):1609–1640, 2002

    2002

  24. [24]

    I. H. Sloan and A. V. Reztsov. Component-by-component c onstruction of good lattice rules. Math. Comput. , 71(237):263–273, Jan. 2002. 26 A Detail results for some numerical tests A.1 Results for projection domain test L Lattice 20 21 22 23 24 25 1 3.420E-01 4.493E-01 7.891E-01 8.948E-01 9.336E-01 9.432E-01 3 5.916E-01 4.472E-01 3.695E-02 1.034E-01 4.029E...

    2002