High degree quadrature rules with pseudorandom rational nodes
Pith reviewed 2026-05-24 17:19 UTC · model grok-4.3
The pith
A quadrature rule of degree 2k+1 is obtained as a linear combination of k+1 degree-one rules whose nodes are rational pseudorandom numbers.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
From a pair of companion rules a mean-rule transformation produces a quadrature rule whose degree of precision exceeds that of the original pair. The mean rule coincides with the least-squares optimal linear combination of two rules of equal degree. The construction is generalized to show that any degree-2k+1 rule can be realized exactly as a linear combination of k+1 degree-one rules whose nodes are chosen to be rational and pseudorandom.
What carries the argument
The mean rule transformation, which produces a higher-degree quadrature rule from a pair of companion rules and is extended to linear combinations of degree-one rules on rational pseudorandom nodes.
If this is right
- Rules of arbitrarily high degree are obtained by combining sufficiently many degree-one rules on rational pseudorandom nodes.
- Repeated application of the mean rule to successive companion pairs systematically raises the degree of precision.
- The mean rule supplies the unique linear combination of two equal-degree rules that is optimal in the least-squares sense.
- Explicit constructions for small k are obtained by direct algebraic solution once the pseudorandom nodes are fixed.
Where Pith is reading between the lines
- The method replaces the usual nonlinear system for Gaussian nodes and weights with a linear system once the nodes are prescribed.
- Because the nodes are rational, all weights and final coefficients remain rational when the original degree-one rules have rational weights.
- The same linear-combination structure could be applied to other basic rules, such as endpoint or midpoint rules, to generate new families.
Load-bearing premise
Suitable companion rules exist for any given pair and rational pseudorandom nodes can always be chosen so that the indicated linear combination attains exactly degree 2k+1.
What would settle it
For k=2, select four explicit rational pseudorandom nodes and the corresponding weights for four degree-one rules; compute the moments of the resulting linear combination up to order 5 and check whether all five moments match those of the exact integral.
read the original abstract
After introducing the definitions of positive, negative and companion rules, from a given pair of companion rules we construct a new rule with higher degree of precision The scheme is generalized giving rise to a transformation which we call the mean rule. We show that the mean rule is the best approximation, in the sense of least-squares, obtained from a linear combination of two rules of the same degree of precision. Finally, we show that a rule of degree 2k+1 can be constructed as linear combination of k+1 rules of degree one and rational pseudorandom nodes. Several worked examples are presented.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript defines positive, negative, and companion quadrature rules. Starting from a pair of companion rules it constructs a new rule of higher degree of precision; the construction is generalized to a transformation called the mean rule, which is shown to be the least-squares optimal linear combination of two rules of equal degree. The central claim is that, for any k, a quadrature rule of exact degree 2k+1 can be realized as a linear combination of k+1 degree-1 rules whose nodes are chosen to be rational and pseudorandom. Several worked examples are presented.
Significance. If the existence of the required pseudorandom rational nodes is rigorously established and the constructions are made fully explicit, the approach would supply a systematic method for building high-precision quadrature rules that retain rational nodes, a property of interest in certain numerical-integration settings. The explicit worked examples constitute a concrete strength of the manuscript.
major comments (2)
- [Abstract] Abstract (final sentence): the claim that a rule of degree 2k+1 can always be obtained as a linear combination of k+1 degree-1 companion rules with rational pseudorandom nodes imposes 2k+2 independent moment conditions on the node locations and the combination weights, yet the manuscript supplies neither a degree-of-freedom count nor an existence argument for the resulting nonlinear system.
- [Mean-rule section] Mean-rule generalization (paragraph following the definition of the mean rule): the transformation is asserted to produce a rule of higher precision for arbitrary companion pairs, but no proof is given that the required companion rules exist for every input pair or that the pseudorandom property is preserved under the linear combination.
minor comments (1)
- [Abstract] Abstract: missing sentence break between 'precision' and 'The scheme'.
Simulated Author's Rebuttal
We thank the referee for the careful reading and the constructive major comments. We address each point below and will revise the manuscript to incorporate clarifications and additional arguments where the current version is incomplete.
read point-by-point responses
-
Referee: [Abstract] Abstract (final sentence): the claim that a rule of degree 2k+1 can always be obtained as a linear combination of k+1 degree-1 companion rules with rational pseudorandom nodes imposes 2k+2 independent moment conditions on the node locations and the combination weights, yet the manuscript supplies neither a degree-of-freedom count nor an existence argument for the resulting nonlinear system.
Authors: The referee is correct that the abstract states the general claim without an accompanying degree-of-freedom count or explicit existence argument for the nonlinear system. The manuscript constructs the higher-degree rule by iterated application of the mean rule to an initial set of k+1 degree-1 companion rules with chosen rational pseudorandom nodes, and the worked examples illustrate that the moment conditions can be met. We will revise the abstract and add a short paragraph in Section 3 (or a new subsection) supplying the requested count: each successive mean-rule step introduces one free combination weight and one new rational node, furnishing the two additional degrees of freedom needed to satisfy the next pair of moment conditions. A brief density argument for the existence of suitable rational nodes will also be included. revision: yes
-
Referee: [Mean-rule section] Mean-rule generalization (paragraph following the definition of the mean rule): the transformation is asserted to produce a rule of higher precision for arbitrary companion pairs, but no proof is given that the required companion rules exist for every input pair or that the pseudorandom property is preserved under the linear combination.
Authors: We agree that the manuscript asserts the higher-precision property of the mean rule for arbitrary companion pairs without a separate existence proof or a verification that the pseudorandom character is inherited by the resulting rule. The least-squares optimality is proved, and the algebraic cancellation of the first two additional moments is shown explicitly, but the general existence of suitable companion pairs and preservation of rationality/pseudorandomness under the linear combination are not addressed. In the revision we will insert a short proof that, when the input nodes are rational, the optimal weights remain rational and the output nodes can again be chosen rational while preserving the pseudorandom selection criterion. revision: yes
Circularity Check
No significant circularity; constructions are explicit and example-driven
full rationale
The paper defines companion rules, constructs higher-precision rules via the mean-rule transformation from pairs of companions, proves the mean rule is the least-squares best linear combination of same-degree rules, and exhibits explicit linear combinations of k+1 degree-1 rules with rational pseudorandom nodes that attain degree 2k+1, supported by worked examples. None of these steps reduce a claimed result to a fitted parameter, self-referential definition, or load-bearing self-citation; the final existence claim is asserted through concrete constructions rather than by tautology or imported uniqueness theorems. The derivation chain therefore remains self-contained against external benchmarks.
Axiom & Free-Parameter Ledger
axioms (1)
- domain assumption Existence of companion quadrature rules and the validity of least-squares optimality for linear combinations of quadrature rules.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.