Related papers: Self-Similar Factor Approximants
The self-consistent expansion (SCE) is a powerful technique for obtaining perturbative solutions to problems in statistical physics but it suffers from a subtle problem - too much freedom! The SCE can be used to generate an enormous number…
Several construction methods for rational approximations to functions of one real variable are described in the present paper; the computational results that characterize the comparative accuracy of these methods are presented; an effect of…
In this paper we provide a rigorous mathematical foundation for continuous approximations of a class of systems with piece-wise continuous functions. By using techniques from the theory of differential inclusions, the underlying piece-wise…
We present a new method for approximating real-valued functions on ${\mathbb R}^+$ by linear combinations of exponential functions with complex coefficients. The approach is based on a multi-point Pad\'e approximation of the Laplace…
Derivative-matching approximations are constructed as power series built from functions. The method assumes the knowledge of special values of the Bell polynomials of the second kind, for which we refer to the literature. The presented…
We consider the random continued fraction S(t) := 1/(s_1 + t/(s_2 + t/(s_3 + >...))) where the s_n are independent random variables with the same gamma distribution. For every realisation of the sequence, S(t) defines a Stieltjes function.…
The self-similarity in space and time (hereafter self-similarity), either deterministic or statistical, is characterized by similarity exponents and a function of scaled variable, called the scaling function. In the present paper, we…
Function approximation and recovery via some sampled data have long been studied in a wide array of applied mathematics and statistics fields. Analytic tools, such as the Poincar\'e inequality, have been handy for estimating the…
Due to their flexibility, Gaussian processes (GPs) have been widely used in nonparametric function estimation. A prior information about the underlying function is often available. For instance, the physical system (computer model output)…
Functional data are frequently accompanied by a parametric template that describes the typical shapes of the functions. However, these parametric templates can incur significant bias, which undermines both utility and interpretability. To…
A simple and very accurate method to approximate a function with a finite number of discontinuities is presented. This method relies on hyperbolic tangent functions of rational arguments as connecting functions at the discontinuities, each…
Perspective functions arise explicitly or implicitly in various forms in applied mathematics and in statistical data analysis. To date, no systematic strategy is available to solve the associated, typically nonsmooth, optimization problems.…
Given the first 20-100 coefficients of a typical generating function of the type that arises in many problems of statistical mechanics or enumerative combinatorics, we show that the method of differential approximants performs surprisingly…
We provide several asymptotic expansions of the prime counting function $\pi(x)$ and related functions. We define an {\it asymptotic continued fraction expansion} of a complex-valued function of a real or complex variable to be a possibly…
We use Pade approximants to systematically approximate scalar unparticle propagators and their associated phase factors by a finite number of ordinary particles. This is possible for conformal dimensions 1<d<2, and also for d>2 if we add…
Convergence of diagonal Pad\'e approximants is studied for a class of functions which admit the integral representation $ {\mathfrak F}(\lambda)=r_1(\lambda)\int_{-1}^1\frac{td\sigma(t)}{t-\lambda}+r_2(\lambda), $ where $\sigma$ is a finite…
Given a system of functions f = (f1, . . . , fd) analytic on a neighborhood of some compact subset E of the complex plane, we give necessary and sufficient conditions for the convergence with geometric rate of the common denominators of…
We define a new class of set functions that in addition to being monotone and subadditive, also admit a very limited form of submodularity defined over a permutation of the ground set. We refer to this permutation as a submodular order.…
Consider an $s$-dimensional function being evaluated at $n$ points of a low discrepancy sequence (LDS), where the objective is to approximate the one-dimensional functions that result from integrating out $(s-1)$ variables. Here, the…
Fixpoints are ubiquitous in computer science and when dealing with quantitative semantics and verification one often considers least fixpoints of (higher-dimensional) functions over the non-negative reals. We show how to approximate the…