SearcharxivSearch

arXiv · 2607.14511

Adaptive-precision computation of custom Gauss quadrature for statistical applications

Abstract

An $n$-point Gauss quadrature rule approximates the weighted integral of a function by a weighted sum of $n$ evaluations of this function and is exact for polynomials of degree at most $2n-1$. Such rules can be highly accurate with relatively few evaluations of this function. For weight functions associated with classical orthogonal polynomials of a continuous variable (such as Legendre, Hermite and Laguerre), these quadrature rules are readily available. We suppose that this is not the case, so that these rules must be custom-made. We present CustomGaussQuadrature, a Julia package that implements two approaches for computing the Gauss quadrature nodes and weights: the moment determinants method and the Stieltjes procedure. The principal contribution is an implementation of the ill-conditioned moment determinants method with adaptively chosen working precision. Comparisons between computations at increasing precisions provide practical error indicators used to target absolute and relative errors in the Gauss rule nodes and weights, respectively, of about $10^{-16}$. The package also adapts the working precision and number of auxiliary quadrature nodes used for the Stieltjes procedure. Numerical examples using scaled chi and Weibull probability density functions as weight functions show close agreement between the results obtained by the two approaches. The package is intended particularly for statistical applications in which a single custom Gauss rule is computed once and then reused to approximate many weighted integrals having the same weight function but different computationally expensive integrands.

Explore related subjects

Keep this discovery

BibTeXRIS

Paul Kabaila. 2026-07-16. Adaptive-precision computation of custom Gauss quadrature for statistical applications. https://arxiv.org/abs/2607.14511

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Estimating Hierarchically Rank Structured Covariance Matrices

We consider the problem of estimating a high-dimensional covariance matrix from a very limited number of samples. This problem is ubiquitous in computational fluid dynamics, where a small number of fluid snapshots must be used to construct a Gramian matrix determining a reduced-order model, as well as in computational geoscience, where a small ensemble of Earth system forecasts must be used to estimate the covariance matrix associated with the forecast uncertainty. It is common practice to regularize the small-sample covariance by imposing a "localization" structure that enforces a physically realistic correlation length scale, imposing a sparsity constraint, "shrinking" towards a prescribed target, or attenuating small correlations. We propose an alternate technique that regularizes the small-sample covariance by imposing hierarchical rank structure. Compared to regularization methods that assume sparsity such as spatial localization, hierarchical rank structure accommodates a wider range of covariance matrices, roughly corresponding to situations where long-range correlations vary more smoothly than short-range ones. It also results in a data-sparse matrix format that permits highly efficient matrix-vector products. We present theory and algorithms which show how to efficiently estimate a high-dimensional, hierarchically rank structured covariance matrix from limited samples. Through an error analysis and numerical experiments with a variety of model problems, we demonstrate that these techniques are effective at reducing sampling errors, and that in many cases they achieve smaller estimation error than conventional techniques.

stat.CO

Optimal Slice-Adaptive Tuning of Hybrid Slice Sampling

Slice sampling is a Markov chain Monte Carlo algorithm that draws its next state uniformly from a "slice"---a super-level set of the target density function---at each iteration, thereby providing automatic local adaptivity to the scale of the target. In practice the exact slice is not known, so general-purpose implementations use an approximate slice that is grown from a starting interval of length $w>0$, with a computational cost that depends on $w$. This work presents an analysis of the average per-iteration number of target density evaluations, as a function of $w$, of hybrid slice sampling with various slice-finding schemes for targets with contiguous slices. The paper uses the results of the analysis to develop automated, slice-adaptive tuning schemes along with suboptimality bounds and asymptotic convergence guarantees. Simulations demonstrate that the tuning schemes reliably yield near-optimal slice-adaptive tuning with essentially no dependence on the initial setting of $w$.

stat.CO