Related papers: Computation of the Schl\"{a}fli function
In approximation theory, it is standard to approximate functions by polynomials expressed in the Chebyshev basis. Evaluating a polynomial $f$ of degree n given in the Chebyshev basis can be done in $O(n)$ arithmetic operations using the…
In this work we discuss techniques for the numerical computation of Fox functions that represent Feynman integrals. Illustrative examples based on Sinc numerical methods and Quasi-Monte Carlo methods are given
We show that off-shell perturbative amplitudes with arbitrary number of external lines and complex masses can be reduced to $I$-fold integrals of the generalized Schl\"{a}fli functions, where $I$ is the number of lines in the corresponding…
This paper deals with approximation of smooth convex functions $f$ on an interval by convex algebraic polynomials which interpolate $f$ at the endpoints of this interval. We call such estimates "interpolatory". One important corollary of…
For the quantum integer $[n]_q = 1+q+...+q^{n-1}$ there is a natural polynomial multiplication $*_q$ such that $[m]_q *_q [n]_q = [mn]_q$. This multiplication leads to the functional equation $f_{mn}(q) = f_m(q)f_n(q^m),$ defined on a given…
We propose a fast and stable method for constructing matrix approximations to fractional integral operators applied to series in the Chebyshev fractional polynomials. This method utilizes a recurrence relation satisfied by the fractional…
Chebfun and related software projects for numerical computing with functions are based on the idea that at each step of a computation, a function $f(x)$ defined on an interval $[a,b]$ is "rounded" to a prescribed precision by constructing a…
Let f(m,n) denote the number of relatively prime subsets of {m+1,m+2,...,n}, and let Phi(m,n) denote the number of subsets A of {m+1,m+2,...,n} such that gcd(A) is relatively prime to n. Let f_k(m,n) and Phi_k(m,n) be the analogous counting…
In this paper we introduce a family of rational approximations of the reciprocal of a $\phi$-function involved in the explicit solutions of certain linear differential equations, as well as in integration schemes evolving on manifolds. The…
In this paper I consider the applications of several kinds of approximations of real functions to the problem of verified computation (reliable computing) of the range of implicitly defined real function $x_{n+1} = G(x_{1}, ..., x_{n}),$…
Algorithms and underlying mathematics are presented for numerical computation with periodic functions via approximations to machine precision by trigonometric polynomials, including the solution of linear and nonlinear periodic ordinary…
Given a quaternionic slice regular function $f$, we give a direct and effective way to compute the coefficients of its spherical expansion at any point. Such coefficients are obtained in terms of spherical and slice derivatives of the…
In applied mathematics, especially in optimization, functions are often only provided as so called "Black-Boxes" provided by software packages, or very complex algorithms, which make automatic differentation very complicated or even…
Consider the Mills ratio $f(x)=\big(1-\Phi(x)\big)/\phi(x), \, x\ge 0$, where $\phi$ is the density function of the standard Gaussian law and $\Phi$ its cumulative distribution.We introduce a general procedure to approximate $f$ on the…
We obtain integral representations of the $n$-th derivatives of the Bessel functions with respect to the order. The numerical evaluation of these expressions is very efficient using a double exponential integration strategy. Also, from the…
In this paper we give effective estimates for some classical arithmetic functions defined over prime numbers. First we find the smallest real number $x_0$ so that some inequality involving Chebyshev's $\vartheta$-function holds for every $x…
A wide range of numerical methods exists for computing polynomial approximations of solutions of ordinary differential equations based on Chebyshev series expansions or Chebyshev interpolation polynomials. We consider the application of…
There is presented an approach to find an approximation polynomial of a function with two variables based on the two dimensional discrete Fourier transform. The approximation polynomial is expressed through Chebyshev polynomials. There is…
We establish formulas for the $b$-adic Walsh coefficients of functions in $C^\alpha[0,1]$ for an integer $\alpha \geq 1$ and give upper bounds on the Walsh coefficients of these functions. We also study the Walsh coefficients of periodic…
In this paper, we introduce a new method for calculating fractional integrals and differentials. The method involves an equation that we have obtained from infinite applied integration by parts. The equation works for special class of…