Related papers: Computing the theta function

We consider the problem of computing the partition function $\sum_x e^{f(x)}$, where $f: \{-1, 1\}^n \longrightarrow {\Bbb R}$ is a quadratic or cubic polynomial on the Boolean cube $\{-1, 1\}^n$. In the case of a quadratic polynomial $f$,…

A function $f: \mathbb{R}^d \rightarrow \mathbb{R}$ is referred to as a Sparse Additive Model (SPAM), if it is of the form $f(\mathbf{x}) = \sum_{l \in \mathcal{S}}\phi_{l}(x_l)$, where $\mathcal{S} \subset [d]$, $|\mathcal{S}| \ll d$.…

For $f$ analytic and close to convex in $D=\{z: |z|< 1\}$, we give sharp estimates for the logarithmic coefficients $\gamma_{n}$ of $f$ defined by $\log \dfrac{f(z)}{z}=2\sum_{n=1}^{\infty} \gamma_{n}z^{n}$ when $n=1, 2,3$.

We investigate numerically efficient approximations of eigenspaces associated to symmetric and general matrices. The eigenspaces are factored into a fixed number of fundamental components that can be efficiently manipulated (we consider…

We propose and investigate two new methods to approximate $f({\bf A}){\bf b}$ for large, sparse, Hermitian matrices ${\bf A}$. The main idea behind both methods is to first estimate the spectral density of ${\bf A}$, and then find…

We construct a uniformly discrete, and even sparse, sequence of real numbers $\Lambda=\{\lambda_n\}$ and a function g in $L^2(R)$, such that for every q>2, every function f in $L^2(R)$ can be approximated with arbitrary small error by a…

We prove that for $s=\sigma+it$ with $\sigma\ge0$ and $0<t\le x$, we have \[\zeta(s)=\sum_{n\le x}n^{-s}+\frac{x^{1-s}}{(s-1)}+\Theta\frac{29}{14} x^{-\sigma},\qquad \frac{29}{14}=2.07142\dots\] where $\Theta$ is a complex number with…

This paper develops a comprehensive probabilistic setup to compute approximating functions in active subspaces. Constantine et al. proposed the active subspace method in (Constantine et al., 2014) to reduce the dimension of computational…

We consider methods for finding high-precision approximations to simple zeros of smooth functions. As an application, we give fast methods for evaluating the elementary functions log(x), exp(x), sin(x) etc. to high precision. For example,…

We introduce new method of optimization for finding free parameters of affine iterated function systems (IFS), which are used for fractal approximation. We provide the comparison of effectiveness of fractal and quadratic types of…

In some applications, one is interested in reconstructing a function $f$ from its Fourier series coefficients. The problem is that the Fourier series is slowly convergent if the function is non-periodic, or is non-smooth. In this paper, we…

Consider systems of equations $q_i(x)=0$, where $q_i: {\Bbb R}^n \longrightarrow {\Bbb R}$, $i=1, \ldots, m$, are quadratic forms. Our goal is to tell efficiently systems with many non-trivial solutions or near-solutions $x \ne 0$ from…

We propose a general method for optimization with semi-infinite constraints that involve a linear combination of functions, focusing on the case of the exponential function. Each function is lower and upper bounded on sub-intervals by…

The distribution function of the sum $Z$ of two standard normally distributed random variables $X$ and $Y$ is computed with the concept of copulas to model the dependency between $X$ and $Y$. By using implicit copulas such as the Gauss- or…

This paper introduces a new numerical method for approximating the Lambert W function in the real domain. The method transforms the function into a simpler form that allows iterative refinement of an initial guess. Two iterative strategies…

For a finite group $G$, Frobenius found a formula for the values of the function $\sum_{\mathrm{Irr} G} (\dim\, \pi)^{-s}$ for even integers $s$, where $\mathrm{Irr} G$ is the set of irreducible representations of $G$. We generalize this…

In a number of problems in computational physics, a finite sum of kernel functions centered at $N$ particle locations located in a box in three dimensions must be extended by imposing periodic boundary conditions on box boundaries. Even…

Hardy and Littlewood's approximate functional equation for quadratic Weyl sums (theta sums) provides, by iterative application, a powerful tool for the asymptotic analysis of such sums. The classical Jacobi theta function, on the other…

We consider the task of approximating a matrix function $f(A)$, where $A$ is a matrix in which only a relatively small number of (not necessarily consecutive) sub- and superdiagonals contain nonzero entries. Approximating $f$ by a…

We seek to approximate a composite function h(x) = g(f(x)) with a global polynomial. The standard approach chooses points x in the domain of f and computes h(x) at each point, which requires an evaluation of f and an evaluation of g. We…