Related papers: Self-replication and Borwein-like algorithms
Special arithmetic series $f(x)=\sum_{n=0}^{\infty}c_nx^n$, whose coefficients $c_n$ are normally given as certain binomial sums, satisfy "self-replicating" functional identities. For example, the equation…
Given a residually connected incidence geometry $\Gamma$ that satisfies two conditions, denoted $(B_1)$ and $(B_2)$, we construct a new geometry $H(\Gamma)$ with properties similar to those of $\Gamma$. This new geometry $H(\Gamma)$ is…
In this article we give evaluations of the two complete elliptic integrals $K$ and $E$ in the form of Ramanujans type-$\pi$ formulas. The result is a formula for $\Gamma(1/4)^2\pi^{-3/2}$ with accuracy about 120 digits per term.
On the basis of the generalized argument principle, here we develop a numerical scheme for locating zeros and poles of a meromorphic function. A subdivision-transformation-calculation scheme is proposed to ensure the algorithm stability. A…
In this paper, we introduce a new and efficient data augmentation approach to the posterior inference of the models with shape parameters when the reciprocal gamma function appears in full conditional densities. Our approach is to…
Using the reflection formula of the Gamma function, we derive a new formula for the Taylor coefficients of the reciprocal Gamma function. The new formula provides effective asymptotic values for the coefficients even for very small values…
In this paper we calculate some Generalized Selberg integrals. The answer is expressed in terms of $\Gamma$-functions. Integrals of this type serve as normalization constants or directly via undoing 2-D integrals for determination of…
We introduce a natural definition for sums of the form \[ \sum_{\nu=1}^x f(\nu) \] when the number of terms x is a rather arbitrary real or even complex number. The resulting theory includes the known interpolation of the factorial by the…
We propose an iterative algorithm to interpolate graph signals from only a partial set of samples. Our method is derived from the well known Papoulis-Gerchberg algorithm by considering the optimal value of a constant involved in the…
A method of representation of a solution as segments of the series in powers of the step of the independent variable is expanded for solving complex systems of ordinary differential equations (ODE): the Lorenz system and other systems. A…
This paper considers the problem of reconstructing sparse or compressible signals from one-bit quantized measurements. We study a new method that uses a log-sum penalty function, also referred to as the Gaussian entropy, for sparse signal…
A qualitative comparison of total variation like penalties (total variation, Huber variant of total variation, total generalized variation, ...) is made in the context of global seismic tomography. Both penalized and constrained…
A new computational framework for evaluation of the gamma function $\Gamma(z)$ over the complex plane is developed. The algorithm is based on interpolation by rational functions, and generalizes the classical methods of Lanczos…
We consider nonparametric Bayesian estimation inference using a rescaled smooth Gaussian field as a prior for a multidimensional function. The rescaling is achieved using a Gamma variable and the procedure can be viewed as choosing an…
A series transformation idea inspired by a formula of R. W. Gosper and some asymptotic expansions for the central binomial coefficients leads us to new accurate approximations for the Gamma function.
In this article using the theory of Eisenstein series, we give rise to the complete evaluation of two Gauss hypergeometric functions. Moreover we evaluate the modulus of each of these functions and the values of the functions in terms of…
Reconstruction of images from noisy linear measurements is a core problem in image processing, for which convex optimization methods based on total variation (TV) minimization have been the long-standing state-of-the-art. We present an…
In a recently developed approximation technique for quantum field theory the standard one-loop result is used as a seed for a recursive formula that gives a sequence of improved Gaussian approximations for the generating functional. In this…
In recent years, several algorithms, which approximate matrix decomposition, have been developed. These algorithms are based on metric conservation features for linear spaces of random projection types. We show that an i.i.d sub-Gaussian…
Consider a random graph process with $n$ vertices corresponding to points $v_{i} \sim {Unif}[0,1]$ embedded randomly in the interval, and where edges are inserted between $v_{i}, v_{j}$ independently with probability given by the graphon…