Related papers: Custom-made Gauss quadrature for statisticians
In this paper, we consider the Gauss quadrature formulae corresponding to some modifications of anyone of the four Chebyshev weights, considered by Gautschi and Li in \cite{gauli}. As it is well known, in the case of analytic integrands,…
We introduce CUTS-GPR, a new method for performing numerically exact Gaussian process regression (GPR) in high-dimensional settings. The key component of CUTS-GPR is an extremely fast kernel matrix-vector product, which exhibits near-linear…
The search for multivariate quadrature rules of minimal size with a specified polynomial accuracy has been the topic of many years of research. Finding such a rule allows accurate integration of moments, which play a central role in many…
Importance sampling (IS) and numerical integration methods are usually employed for approximating moments of complicated target distributions. In its basic procedure, the IS methodology randomly draws samples from a proposal distribution…
The discretization of velocity space plays a crucial role in the accuracy and efficiency of multiscale Boltzmann solvers. Conventional velocity space discretization methods suffer from uneven node distribution and mismatch issues, limiting…
A tutorial-style introduction to the R-package robFitConGraph is given. The latter provides a robust goodness-of-fit test for Gaussian graphical models. Its use is demonstrated at a data example on music performance anxiety, which also…
This paper proposes an algorithm to generate random numbers from any member of the truncated multivariate elliptical family of distributions with a strictly decreasing density generating function. Based on Neal (2003) and Ho et al. (2012),…
A high-resolution Eulerian method for simulating high-speed polydisperse granular multiphase flows has been developed. The governing equations include a compressible gas that is coupled to mass-based moment equations for a polydisperse…
Efficient operator scheduling is a fundamental challenge in software compilation and hardware synthesis. While recent differentiable approaches have sought to replace traditional ones like exact solvers or heuristics with gradient-based…
Let $d$ and $k$ be positive integers. Let $\mu$ be a positive Borel measure on $\mathbb{R}^2$ possessing finite moments up to degree $2d-1$. If the support of $\mu$ is contained in an algebraic curve of degree $k$, then we show that there…
The method of random projection (RP) is the standard technique in machine learning and many other areas, for dimensionality reduction, approximate near neighbor search, compressed sensing, etc. Basically, RP provides a simple and effective…
This work provides a computationally efficient and statistically consistent moment-based estimator for mixtures of spherical Gaussians. Under the condition that component means are in general position, a simple spectral decomposition…
Gaussian processes (GPs) are a highly flexible, nonparametric statistical model that are commonly used to fit nonlinear relationships or account for correlation between observations. However, the computational load of fitting a Gaussian…
Approximation using Fourier features is a popular technique for scaling kernel methods to large-scale problems, with myriad applications in machine learning and statistics. This method replaces the integral representation of a…
The work reported in this article presents a high-order, stable, and efficient Gegenbauer pseudospectral method to solve numerically a wide variety of mathematical models. The proposed numerical scheme exploits the stability and the…
Approximation algorithms are widely used in many engineering problems. To obtain a data set for approximation a factorial design of experiments is often used. In such case the size of the data set can be very large. Therefore, one of the…
We analyze the Gaussian approximation as a method to obtain the first and second moments of a stochastic process described by a master equation. We justify the use of this approximation with ideas coming from van Kampen's expansion approach…
Customizing the precision of data can provide attractive trade-offs between accuracy and hardware resources. We propose a novel form of vector computing aimed at arrays of custom-precision floating point data. We represent these vectors in…
This paper presents in detail the originally developed Quadratic Point Estimate Method (QPEM), aimed at efficiently and accurately computing the first four output moments of probabilistic distributions, using 2n^2+1 sample (or sigma)…
A Radial Basis Function Generated Finite-Differences (RBF-FD) inspired technique for evaluating definite integrals over the volume of the ball in three dimensions is described. Such methods are necessary in many areas of Applied…