Related papers: Custom-made Gauss quadrature for statisticians
A Gaussian process (GP)-based methodology is proposed to emulate complex dynamical computer models (or simulators). The method relies on emulating the numerical flow map of the system over an initial (short) time step, where the flow map is…
In this paper we consider the space of those probability distributions which maximize the $q$-R\'enyi entropy. These distributions have the same parameter space for every $q$, and in the $q=1$ case these are the normal distributions. Some…
Many statistical models are algebraic in that they are defined by polynomial constraints or by parameterizations that are polynomial or rational maps. This opens the door for tools from computational algebraic geometry. These tools can be…
We consider parallel computation for Gaussian process calculations to overcome computational and memory constraints on the size of datasets that can be analyzed. Using a hybrid parallelization approach that uses both threading (shared…
We develop and analyze stochastic inexact Gauss-Newton methods for nonlinear least-squares problems and for nonlinear systems ofequations. Random models are formed using suitable sampling strategies for the matrices involved in the…
This paper considers solving convex quadratic programs (QPs) in a real-time setting using a regularized and smoothed Fischer-Burmeister method (FBRS). The Fischer-Burmeister function is used to map the optimality conditions of the quadratic…
We propose a novel discrete method of constructing Gaussian Random Fields (GRF) based on a combination of modified spectral representations, Fourier and Blob. The method is intended for Direct Numerical Simulations of the V-Langevin…
This paper describes the generation of initial conditions for numerical simulations in cosmology with multiple levels of resolution, or multiscale simulations. We present the theory of adaptive mesh refinement of Gaussian random fields…
Solving the population balance equation (PBE) for the dynamics of a dispersed phase coupled to a continuous fluid is expensive. Still, one can reduce the cost by representing the evolving particle density function in terms of its moments.…
We examine the Kogut-Susskind formulation of lattice gauge theories under the light of fermionic and bosonic degrees of freedom that provide a description useful to the development of quantum simulators of gauge invariant models. We…
A collection of subroutines and examples of their uses, as well as the underlying numerical methods, are described for generating orthogonal polynomials relative to arbitrary weight functions. The object of these routines is to produce the…
A quadrature-based finite-difference lattice Boltzmann model is developed that is suitable for simulating relativistic flows of massless particles. We briefly review the relativistc Boltzmann equation and present our model. The quadrature…
Gaussian processes (GPs) are commonplace in spatial statistics. Although many non-stationary models have been developed, there is arguably a lack of flexibility compared to equipping each location with its own parameters. However, the…
The Gaussian curvature of a two-dimensional Riemannian manifold is uniquely determined by the choice of the metric. The formulas for computing the curvature in terms of components of the metric, in isothermal coordinates, involve the…
Stieltjes, Perron, and Markov in analysis of the moment problem, for absolutely continuous measures, constructed the underlying measure as the discontinuity across the cut of a Cauchy representation of an otherwise real-analytic function.…
Gauss-Lobatto quadrature nodes and weights are optimal for closed summation-by-parts (SBP) formulations based on polynomial approximation spaces in the sense that for a prescribed function space they yield an SBP operator of minimal…
A machine-learnable variational scheme using Gaussian radial basis functions (GRBFs) is presented and used to approximate linear problems on bounded and unbounded domains. In contrast to standard mesh-free methods, which use GRBFs to…
Gaussian processes are used in many machine learning applications that rely on uncertainty quantification. Recently, computational tools for working with these models in geometric settings, such as when inputs lie on a Riemannian manifold,…
We discuss the best methods available for computing the gamma function $\Gamma(z)$ in arbitrary-precision arithmetic with rigorous error bounds. We address different cases: rational, algebraic, real or complex arguments; large or small…
The Gaussian expansion has been developed since early 80s as a powerful analytical method, which enables nonperturbative studies of various systems using `perturbative' calculations. Recently the method has been used to suggest that 4d…