Pith. sign in

REVIEW 3 major objections 6 minor 1 cited by

Constructing Positive Interpolatory Cubature Formulas

T0 review · 3 major / 6 minor · reviewed 2026-08-27 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A constructive two-step procedure realizes Tchakaloff's positive cubature formulas.

desk verdict A genuinely constructive route to positive interpolatory cubature, worth refereeing once the omitted lemmas and Algorithm 4.1's control-flow bug are fixed. read the letter →

arxiv 2009.11981 v1 pith:32C7HHBJ submitted 2020-09-24 math.NA cs.NAmath.CAmath.OC

Jan Glaubitz This is my paper · ORCID
classification math.NAcs.NAmath.CAmath.OC MSC 65D3065D3265D0542C05
keywords positivecubatureformulasinterpolatoryTchakaloff'stheoremleast-squaresequidistributedsequencesdiscreteorthonormalbasesSteinitzmethodnumericalintegration
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

Tchakaloff's 1957 theorem guarantees that any compact domain, nonnegative weight function, and finite-dimensional space of continuous functions containing constants admit an exact cubature formula with at most $K$ interior points and positive weights. Its proof is not constructive, and the paper claims to close that gap. The proposed two-step procedure first builds a nonnegative least-squares cubature formula on many evenly spread points — an equidistributed sequence — then applies Steinitz reduction to delete points until at most $K$ remain. The output is exact for the prescribed function space, uses only data points inside the domain, and has all-positive weights. If the procedure works as claimed, it is the first general constructive realization of Tchakaloff's theorem.

What carries the argument

The argument is carried by three objects. First, an equidistributed sequence in $\Omega$, constructed in Remark 2.4 by ordering a one-dimensional dyadic grid and taking tensor products, then deleting points outside $\Omega$; for zero-measure boundaries the deleted sequence is both $F_K(\Omega)$-unisolvent (the only function in $F_K(\Omega)$ vanishing on its first $N$ points is zero for large $N$) and satisfies the discrete-to-continuous inner-product limit (2.6). Second, the continuous and discrete orthonormal bases obtained by Gram-Schmidt from the same initial basis $\{\phi_k\}_{k=1}^K$; Lemma 3.2 shows the discrete basis converges uniformly to the continuous one, which is what forces the least-squares weights to become nonnegative. Third, Steinitz reduction, which from any exact positive combination of $N>K$ point evaluations produces an exact positive combination of at most $N-1$ evaluations, iterable down to $K$. The explicit least-squares weight formula ties these together.

What would settle it

Compute the uniform discrete-to-continuous basis error $\|\pi_k(\cdot; r) - \pi_k(\cdot; \omega)\|_\infty$ for an admissible triple such as $\Omega = B^{(2)} \cup C^{(2)}_{1/2}(1.5,1.5)$, $\omega \equiv 1$, $F_K(\Omega) = P_m(\mathbb{R}^2)$ as $N$ grows; if it does not tend to zero, Lemma 3.2 and the nonnegativity proof collapse. Equivalently, exhibit any admissible triple for which Algorithm 4.1 never reaches nonnegative weights or Algorithm 4.2 terminates with $N > K$; that single example would refute the paper's central claim.

Watch

Extended reading notes

Core claim

Under restrictions (R1)-(R4) — $\Omega$ compact with zero-measure boundary, $F_K(\Omega)$ containing constants, $\omega$ Riemann integrable with nowhere-dense zero set, and the integral positive definite on $F_K(\Omega)$ — the paper proves that Algorithm 4.1 followed by Algorithm 4.2 terminates with an $F_K(\Omega)$-exact cubature formula using at most $K$ data points in $\Omega$ and strictly positive weights. The least-squares step chooses discrete weights $r_n = |\Omega| \omega(x_n)/N$ on an equidistributed sequence, and the weights take the explicit form $w_n^{\mathrm{LS}} = r_n \sum_{k=1}^K \pi_k(x_n; r) I[\pi_k(\cdot; r)]$. Because the discrete orthonormal basis converges uniformly to the continuous orthonormal basis as $N \to \infty$, these weights are nonnegative for all sufficiently large $N$. Steinitz reduction then rewrites the same positive linear combination of point evaluations using fewer points, until the number of points is at most $K$.

Load-bearing premise

The load-bearing premise is that an explicit equidistributed sequence inside $\Omega$ is actually available — obtained, for instance, by deleting tensor-product-grid points outside $\Omega$, which requires the boundary to have measure zero — and that the moments $m_k = I[\phi_k]$ are known exactly; if either is missing, the algorithm cannot be run.

Editorial extensions

If this is right

  • For any domain, weight, and function space satisfying (R1)-(R4), a positive interpolatory cubature formula can now be produced by a terminating algorithm, not merely proven to exist.
  • The construction is not tied to algebraic or trigonometric polynomials; it works for any space of continuous functions containing constants, including radial basis functions or wavelets.
  • All data points in the final formula lie inside $\Omega$, so the formulas remain usable when integrand evaluations are only allowed on the domain.
  • The final formula uses at most $K$ points, so it is genuinely interpolatory; the numerical examples show cases where the reduction even yields $N < K$.
  • The accompanying Matlab implementation makes the procedure directly available for numerical experiments.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A testable extension is to replace the tensor-product grid in Remark 2.4 with any low-discrepancy sequence and measure how quickly the minimal $N$ for nonnegativity decreases; the theory predicts the same guarantee, only the threshold $N_0$ changes.
  • If the reduction step is stable under floating-point arithmetic, the procedure could become a practical fallback for adaptive cubature on implicitly defined or nonstandard domains, where product and symmetry-based rules do not exist.
  • The same least-squares-plus-reduction template might extend to vector-valued integrands or to preserving additional linear constraints, though the paper does not address those cases.
Share X Bluesky LinkedIn Reddit HN

Formalized claims in Lean

  1. Claim #1: Under restrictions (R1)-(R4) — $\Omega$ compact with zero-measure boundary, $F_K(\Omega)$ containing constants, $\omega$ Riemann integrable with nowhere-dense zero set, and the integral positive definite on $F_K(\Omega)$ — the paper proves that Algorithm 4.1 followed by Algorithm 4.2 terminates with an $F_K(\Omega)$-exact cubature formula using at most $K$ data points in $\Omega$ and strictly posi

Signed reviews

No signed human review yet.

Request a human review

A listed scientist reviews the paper for a fee and the review publishes here regardless of verdict. See the reviewers or get listed.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 6 minor

Summary. The paper proposes a constructive two-step procedure for positive interpolatory cubature formulas exact on a finite-dimensional vector space F_K(Ω) of continuous functions containing constants, under restrictions (R1)–(R4) on the domain, weight function, and functional. Step one constructs a nonnegative least-squares cubature formula on points from an equidistributed sequence (Algorithm 4.1); step two reduces the number of points to at most K via Steinitz's method (Algorithm 4.2). The author claims that this realizes Tchakaloff's theorem constructively for the first time, and provides numerical examples for polynomial and trigonometric exactness on a square, a ball, and a nonstandard union domain.

Significance. If the construction is completed and corrected, the result would be a significant contribution to cubature theory: a general constructive algorithm for positive interpolatory cubature formulas with N ≤ K, applicable to nonstandard domains, general weight functions, and general finite-dimensional function spaces. The approach combines classical tools—equidistributed sequences, Gram–Schmidt orthonormalization, least squares, and Steinitz's lemma—and the author provides illustrative numerical evidence and links to Matlab code. These strengths are real. However, the paper as written has a control-flow error in Algorithm 4.1 that makes the central algorithmic claim non-executable, and two load-bearing lemmas (3.1 and 3.2) are stated without proof. These issues are local and repairable but must be addressed before the claim of a constructive Tchakaloff theorem can be accepted.

major comments (3)
  1. [Algorithm 4.1 (Section 4.1)] In Algorithm 4.1, line 10 executes 'N = 2N' inside the 'if r = K' branch. If the initial K-point set is not FK(Ω)-unisolvent, then r < K and N is never increased, so the while condition 'r < K or wmin < 0' remains true forever and the algorithm does not terminate. This is a concrete failure, not a hypothetical edge case: for Ω = [-1,1], ω ≡ 1, and FK = span{1, x^2 - 1}, the first two points of the sequence in (2.7) are -1 and 1, both roots of x^2 - 1, so rank(Φ) = 1 < K = 2. The prose immediately above the algorithm states that N should be doubled when either the point set is not unisolvent or the LS weights are not nonnegative, so the intended behavior is clear, but the pseudocode as printed cannot produce the claimed nonnegative LS-CF. The fix is to move the update N = 2N outside the if branch; this revision is essential.
  2. [Lemmas 3.1 and 3.2 (Section 3.4)] Lemmas 3.1 and 3.2 are stated without proof, with the comment that they are easy to verify as in [17]. These lemmas are load-bearing for Theorem 3.3: Lemma 3.2 is used to conclude that the discrete orthonormal basis converges uniformly to the continuous orthonormal basis, and Lemma 3.1 is used to show that ε_k → 0. Because the present paper claims a generalization to arbitrary vector spaces FK(Ω) of continuous functions, the proof for the general case must be supplied or at least outlined in detail; citing the polynomial-case proof is not sufficient for a refereed publication. As written, the proof of conditional nonnegativity of LS-CFs is incomplete.
  3. [Remark 2.4 (Section 2.2)] For d > 1, the equidistributed sequence is specified only as 'a tensor product grid' of the one-dimensional sequence (2.7), with no explicit ordering. This matters because Algorithm 4.1 uses the first N points of the sequence, and Corollary 2.5 requires the sequence to be both equidistributed in the sense of (2.6) and FK(Ω)-unisolvent for all sufficiently large N. A carelessly chosen product ordering need not yield an equidistributed sequence in Ω; for example, lexicographic ordering of a product grid can fail to be equidistributed in multiple dimensions. The author should specify a concrete enumeration (e.g., a diagonal ordering) or prove that the described construction, with any ordering, still satisfies (2.6).
minor comments (6)
  1. [Section 3.4] There are several typographical errors: 'Fist' should be 'First', and 'their proofs are therefore omit' should be 'their proofs are therefore omitted'.
  2. [Equation (3.16)] In the statement of Lemma 3.1, both limits in (3.16) use the symbol u_N; the second should presumably be v_N, matching the intended convergence u_N → u and v_N → v.
  3. [Section 2.2 and Remark 2.4] Typographical errors include 'hoewever' for 'however', 'euqidistributed' for 'equidistributed', and 'equidistribiuted' for 'equidistributed'.
  4. [Equation (4.5)] In the display after (4.4), 'σvN' should be 'σwN' in the final coefficient of the linear combination.
  5. [Section 4.1, bullet (2)] The phrase 'Otherwise, meaning that X is not FK(Ω)-unisolvent' should read 'X_N' rather than 'X', since the definition of unisolvency applies to the point set X_N.
  6. [Section 5] The numerical experiments are limited to small dimensions and small K (at most K = 15 in the figures), and no convergence or cost study is given. This evidence is illustrative rather than exhaustive, but a brief discussion of scalability would strengthen the paper.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the derivation is self-contained and does not assume Tchakaloff's theorem; the Algorithm 4.1 control-flow issue is a correctness bug, not circular reasoning.

full rationale

The paper's derivation chain is self-contained and does not reduce to its own inputs. The construction takes as given only the domain, weight, function space, exact moments, and an equidistributed unisolvent sequence. It does not assume Tchakaloff's theorem or the existence of a positive interpolatory cubature formula. The nonnegativity of the least-squares formula is proved directly in Theorem 3.3 using the convergence of the discrete inner product to the continuous inner product and uniform convergence of the discrete orthonormal basis to the continuous one; Lemmas 3.1 and 3.2 are stated as extensions of prior polynomial-case results, and their use here is technical rather than a load-bearing assumption of the final conclusion. The Steinitz reduction in Section 4.2 is an independent linear-algebra argument fully presented in the text: given an FK-exact nonnegative cubature formula, a nonzero vector in the null space of the evaluation matrix yields a positive combination with at least one coefficient zero, allowing a point to be removed while preserving exactness and nonnegativity. Self-citations to the author's earlier LS-cubature work are precursors, not premises that secretly encode the conclusion. The numerical experiments compare against Gauss-Legendre-type rules, which is external validation. No fitted parameter is renamed as a prediction, no uniqueness theorem is imported from the authors' prior work, and no ansatz is smuggled in by citation. Therefore the circularity score is 0. A separate observation, not a circularity, is that Algorithm 4.1 as printed places 'N = 2N' inside the 'if r = K' branch, so for an initial K-point set that is not FK-unisolvent the loop would not enlarge N and would not terminate; this is a control-flow defect in the written pseudocode, not a circular dependency in the mathematical argument.

Assumptions & free parameters 0 free parameters · 6 assumptions · 0 invented entities

The central claim rests on the four tagged restrictions (R1)-(R4), plus two implicit assumptions: exact availability of moments, and the existence or constructibility of an equidistributed sequence with the required convergence and unisolvency. No free parameters are fitted. No new entities are introduced.

assumptions (6)
  • domain assumption Omega is compact, has positive volume, and its boundary has measure zero (R1)
    Required for the filtered equidistributed sequence to satisfy (2.6).
  • domain assumption The vector space FK(Omega) contains constants (R2)
    Needed in Theorem 3.3 to factor out the constant and obtain (3.22).
  • domain assumption The weight function omega is Riemann integrable and its zero set is nowhere dense (R3)
    Ensures the discrete inner product with weights r_n = |Omega| omega(x_n)/N is well defined and converges to the continuous inner product.
  • domain assumption The linear functional I is positive definite on FK(Omega) (R4)
    Provides a continuous inner product (3.6) used to define the continuous orthonormal basis.
  • domain assumption The moments m_k = I[phi_k] are known or computable
    Algorithm 4.1 requires the moment vector m in (2.2); the paper assumes existence but not a method to compute it. Without computable moments, the procedure cannot be executed.
  • standard math A sequence (x_n) in Omega exists that is equidistributed in the sense of (2.6) and FK(Omega)-unisolvent
    Delegated to Kuipers and Niederreiter [24]; the paper's Remark 2.4 sketches a construction for Omega that relies on (R1).

how reviews work

0 comments
Cite this review

Pith. "Pith review of Constructing Positive Interpolatory Cubature Formulas." pith.science (2026). https://pith.science/paper/32C7HHBJ

@misc{pith2026200911981,
  author       = {Pith},
  title        = {Pith review of: Constructing Positive Interpolatory Cubature Formulas},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/32C7HHBJ}},
  note         = {Machine review of arXiv:2009.11981}
}
read the original abstract

Positive interpolatory cubature formulas (CFs) are constructed for quite general integration domains and weight functions. These CFs are exact for general vector spaces of continuous real-valued functions that contain constants. At the same time, the number of data points -- all of which lie inside the domain of integration -- and cubature weights -- all positive -- is less or equal to the dimension of that vector space. The existence of such CFs has been ensured by Tchakaloff in 1957. Yet, to the best of the author's knowledge, this work is the first to provide a procedure to successfully construct them.

Figures

Figures reproduced from arXiv: 2009.11981 by the authors.

Figure 1
Figure 1. Illustration of the data points for Ω = B(2) ∪ C (2) 1/2 (1.5, 1.5), ω ≡ 1, and FK(Ω) = Pm(R 2 ) 10 20 30 40 50 60 10-6 10-4 10-2 100 (a) C (2) with ω ≡ 1 10 20 30 40 50 60 10-6 10-4 10-2 100 (b) B(2) with ω ≡ 1 10 20 30 40 50 60 10-6 10-4 10-2 100 (c) B(2) with ω(x) = p kxk2 50 100 150 200 250 10-4 10-3 10-2 10-1 100 101 (d) C (3) with ω ≡ 1 50 100 150 200 250 10-8 10-6 10-4 10-2 100 102 (e) B(3) with ω ≡ 1 50 100 … view at source ↗
Figure 2
Figure 2. Accuracy of the constructed positive interpolatory CF compared to Gauss–Legendre-type [PITH_FULL_IMAGE:figures/full_fig_p015_2.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Efficient and Robust Carath\'{e}odory-Steinitz Pruning of Positive Discrete Measures

    math.NA 2025-10 accept novelty 6.0 of 10

    GSCSP prunes positive discrete measures to N-point moment-preserving rules in O(N^2) memory and O(MN^2+N^3) time, with a local total-variation Lipschitz stability theorem.

Reference graph

Works this paper leans on

37 extracted references · 36 canonical work pages · cited by 1 Pith paper

  1. [17]

    Glaubitz , Stable high-order cubature formulas for experimental data , (2020)

    J. Glaubitz , Stable high-order cubature formulas for experimental data , (2020). Submitted

    work page 2020

  2. [1]

    Bayer and J

    C. Bayer and J. Teichmann , The proof of Tchakaloffs theorem , Proceedings of the AMS, 134 (2006), pp. 3035–3040

    work page 2006

  3. [2]

    Ben-Israel and T

    A. Ben-Israel and T. N. Greville , Generalized Inverses: Theory and Applications , vol. 15 of CMS Books in Mathematics, Springer Science & Business Media, 2003

    work page 2003

  4. [3]

    C. B. Boyer and U. C. Merzbach , A History of Mathematics , John Wiley & Sons, 2011

    work page 2011

  5. [4]

    Cline and R

    R. Cline and R. J. Plemmons , 𝓁2-solutions to underdetermined linear systems, SIAM Review, 18 (1976), pp. 92–106

    work page 1976

  6. [5]

    Cools , Constructing cubature formulae: The science behind the art , Acta Numerica, 6 (1997), pp

    R. Cools , Constructing cubature formulae: The science behind the art , Acta Numerica, 6 (1997), pp. 1– 54

    work page 1997

  7. [6]

    Cools , Monomial cubature rules since Stroud: a compilationpart 2 , Journal of Computational and Applied Mathematics, 112 (1999), pp

    R. Cools , Monomial cubature rules since Stroud: a compilationpart 2 , Journal of Computational and Applied Mathematics, 112 (1999), pp. 21–27

    work page 1999

  8. [7]

    Cools , An encyclopaedia of cubature formulas , Journal of Complexity, 19 (2003), pp

    R. Cools , An encyclopaedia of cubature formulas , Journal of Complexity, 19 (2003), pp. 445–453

    work page 2003

Show all 37 references
  1. [8]

    Cools and P

    R. Cools and P. Rabinowitz , Monomial cubature rules since Stroud: a compilation , Journal of Com- putational and Applied Mathematics, 48 (1993), pp. 309–326

    1993

  2. [9]

    Davis and M

    P. Davis and M. Wilson , Nonnegative interpolation formulas for uniformly elliptic equations , Journal of Approximation Theory, 1 (1968), pp. 374–380

    1968

  3. [10]

    P. J. Davis , A construction of nonnegative approximate quadratures , Mathematics of Computation, 21 (1967), pp. 578–582

    1967

  4. [11]

    P. J. Davis and P. Rabinowitz , Methods of Numerical Integration, Courier Corporation, 2007

    2007

  5. [12]

    Engels , Numerical Quadrature and Cubature, Academic Press, 1980

    H. Engels , Numerical Quadrature and Cubature, Academic Press, 1980

    1980

  6. [13]

    Gautschi , Numerical Analysis, Springer Science & Business Media, 1997

    W. Gautschi , Numerical Analysis, Springer Science & Business Media, 1997

    1997

  7. [14]

    Gautschi, Orthogonal Polynomials: Computation and Approximation, Oxford University Press, 2004

    W. Gautschi, Orthogonal Polynomials: Computation and Approximation, Oxford University Press, 2004

    2004

  8. [15]

    Glaubitz , jglaubitz/positive interpolatory CFs, 2020, https://doi.org/10.5281/zenodo.4019333

    J. Glaubitz , jglaubitz/positive interpolatory CFs, 2020, https://doi.org/10.5281/zenodo.4019333

    2020 doi

  9. [16]

    Glaubitz, Shock Capturing and High-Order Methods for Hyperbolic Conservation Laws , Logos Verlag Berlin GmbH, 2020

    J. Glaubitz, Shock Capturing and High-Order Methods for Hyperbolic Conservation Laws , Logos Verlag Berlin GmbH, 2020

    2020

  10. [18]

    Glaubitz , Stable high order quadrature rules for scattered data and general weight functions , SIAM Journal on Numerical Analysis, 58 (2020), pp

    J. Glaubitz , Stable high order quadrature rules for scattered data and general weight functions , SIAM Journal on Numerical Analysis, 58 (2020), pp. 2144–2164

    2020

  11. [19]

    Glaubitz and P

    J. Glaubitz and P. ¨Offner, Stable discretisations of high-order discontinuous Galerkin methods on equidistant and scattered points, Applied Numerical Mathematics, 151 (2020), pp. 98–118

    2020

  12. [20]

    Haber , Numerical evaluation of multiple integrals , SIAM Review, 12 (1970), pp

    S. Haber , Numerical evaluation of multiple integrals , SIAM Review, 12 (1970), pp. 481–526

    1970

  13. [21]

    J. H. Halton , On the efficiency of certain quasi-random sequences of points in evaluating multi- dimensional integrals, Numerische Mathematik, 2 (1960), pp. 84–90

    1960

  14. [22]

    Hlawka, Funktionen von beschr¨ ankter Variation in der Theorie der Gleichverteilung, Ann

    E. Hlawka, Funktionen von beschr¨ ankter Variation in der Theorie der Gleichverteilung, Ann. Mat. Pura Appl., 54 (1961), pp. 325–333

    1961

  15. [23]

    Huybrechs, Stable high-order quadrature rules with equidistant points, Journal of Computational and Applied Mathematics, 231 (2009), pp

    D. Huybrechs, Stable high-order quadrature rules with equidistant points, Journal of Computational and Applied Mathematics, 231 (2009), pp. 933–947

    2009

  16. [24]

    Kuipers and H

    L. Kuipers and H. Niederreiter , Uniform Distribution of Sequences , Courier Corporation, 2012

    2012

  17. [25]

    J. C. Maxwell , On approximate multiple integration between limits of summation , in Proc. Cambridge Philos. Soc, vol. 3, 1877, pp. 39–47

  18. [26]

    Mysovskikh , The approximation of multiple integrals by using interpolatory cubature formulae , in Quantitative Approximation, Elsevier, 1980, pp

    I. Mysovskikh , The approximation of multiple integrals by using interpolatory cubature formulae , in Quantitative Approximation, Elsevier, 1980, pp. 217–243

    1980

  19. [27]

    I. P. Mysovskikh , Cubature formulae that are exact for trigonometric polynomials , TW Reports, (2001). Edited by R. Cools and H.J. Schmid. CONSTRUCTING POSITIVE INTERPOLATORY CFS 17

    2001

  20. [28]

    Niederreiter , Random Number Generation and Quasi-Monte Carlo Methods , SIAM, 1992

    H. Niederreiter , Random Number Generation and Quasi-Monte Carlo Methods , SIAM, 1992

    1992

  21. [29]

    Steinitz , Bedingt konvergente Reihen und konvexe Systeme , Journal f¨ ur die reine und angewandte Mathematik (Crelles Journal), 1913 (1913), pp

    E. Steinitz , Bedingt konvergente Reihen und konvexe Systeme , Journal f¨ ur die reine und angewandte Mathematik (Crelles Journal), 1913 (1913), pp. 128–176

    1913

  22. [30]

    A. H. Stroud , Approximate Calculation of Multiple Integrals , Prentice-Hall, 1971

    1971

  23. [31]

    Tchakaloff, Formules de cubatures m´ ecaniques ` a coefficients non n´ egatifs, Bull

    V. Tchakaloff, Formules de cubatures m´ ecaniques ` a coefficients non n´ egatifs, Bull. Sci. Math, 81 (1957), pp. 123–134

    1957

  24. [32]

    L. N. Trefethen , Cubature, approximation, and isotropy in the hypercube , SIAM Review, 59 (2017), pp. 469–491

    2017

  25. [33]

    L. N. Trefethen and D. Bau III , Numerical Linear Algebra, vol. 50, SIAM, 1997

    1997

  26. [34]

    van der Corput , Verteilungsfunktionen, in Proc

    J. van der Corput , Verteilungsfunktionen, in Proc. Akad. Amsterdam, vol. 38, 1935, p. 6

    1935

  27. [35]

    Weyl , ¨Uber die Gleichverteilung von Zahlen mod

    H. Weyl , ¨Uber die Gleichverteilung von Zahlen mod. eins , Mathematische Annalen, 77 (1916), pp. 313– 352

    1916

  28. [36]

    M. W. Wilson , Discrete least squares and quadrature formulas, Mathematics of Computation, 24 (1970), pp. 271–282

    1970

  29. [37]

    M. W. Wilson , Necessary and sufficient conditions for equidistant quadrature formula , SIAM Journal on Numerical Analysis, 7 (1970), pp. 134–141

    1970

Pith tools

Reviewed August 27, 2026 · model on record in the stance chip above.